Publisher
Springer International Publishing
Reference17 articles.
1. van Aardenne-Ehrenfest, T., de Bruijn, N.G.: Circuits and trees in oriented linear graphs. In: Classic Papers in Combinatorics, pp. 149–163. Birkhäuser Boston, Boston (1987). https://doi.org/10.1007/978-0-8176-4842-8_12
2. Bent, S.W., Manber, U.: On non-intersecting Eulerian circuits. Discret. Appl. Math. 18(1), 87–94 (1987)
3. Bernardini, G., Chen, H., Fici, G., Loukides, G., Pissis, S.P.: Reverse-safe data structures for text indexing. In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, 5–6 January 2020, pp. 199–213 (2020)
4. Brightwell, G.R., Winkler, P.: Counting Eulerian circuits is #P-complete. In: ALENEX/ANALCO, pp. 259–262. ACM SIAM (2005)
5. Lecture Notes in Computer Science;A Conte,2021
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献