Finding and Counting Given Length Cycles

Algorithmica (New York)

Volumn 17, Issue 3, 1997, Pages 209-223

  Alon, N ^a   Yuster, R ^a   Zwick, U ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Cycles; Graph algorithms

Indexed keywords

EID: 0000445027     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02523189     Document Type: Article

References (17)

1. N. Alon, R. Yuster, and U. Zwick. Finding and counting given length cycles. Proceedings of the 2nd European Symposium on Algorithms, Utrecht, Lecture Notes in Computer Science, Vol. 855, pages 354-364. Springer-Verlag, 1994.
2. N. Alon, R. Yuster, and U. Zwick. Color-coding. Journal of the ACM, 42:844-856, 1995.
3. B. Bollobás. On generalized graphs. Acta Mathematica Academiae Scientarium Hungaricae, 16:447-452, 1965.
4. B. Bollobás. Extremal Graph Theory. Academic Press, New York, 1978.
5. J. A. Bondy and M. Simonovits. Cycles of even length in graphs. Journal of Combinatorial Theory, Series B, 16:97-105, 1974.
6. N. Chiba and L. Nishizeki. Arboricity and subgraph listing algorithms. SIAM Journal on Computing, 14:210-223, 1985.
7. D. Eppstein. Subgraph isomorphism in planar graphs and related problems. Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, pages 632-640, 1995.
8. A. Itai and M. Rodeh. Finding a minimum circuit in a graph. SIAM Journal on Computing, 7:413-423. 1978.
9. T. Kloks, D. Kratsch, and H. Müller. Finding and counting small induced subgraphs efficiently. Proceedings of the 21st International Workshop on Graph-Theoretic Concepts in Computer Science, Aachen, Lecture Notes in Computer Science, Vol. 1017, pages 14-23. Springer-Verlag, 1995.
10. D. W. Matula and L. L. Beck. Smallest-last ordering and clustering and graph coloring algorithms. Journal of the ACM, 30:417-427, 1983.
11. B. Monien. How to find long paths efficiently. Annals of Discrete Mathematics, 25:239-254, 1985.
12. J. Nešetřil and S. Poljak. On the complexity of the subgraph problem. Commentationes Mathematicae Universitatis Carolinae, 26(2):415-419, 1985.
13. C. H. Papadimitriou and M. Yannakakis. The clique problem for planar graphs. Information Processing Letters, 13:131-133, 1981.
14. D. Richards. Finding short cycles in a planar graph using separators. Journal of Algorithms, 7:382-394, 1986.
15. G. Sundaram and S. S. Skiena. Recognizing small subgraphs. Networks, 25:183-191, 1995.
16. R. Yuster and U. Zwick. Finding even cycles even faster. Proceedings of the 21st International Colloquium on Automata, Languages and Programming, Jerusalem. Lecture Notes in Computer Science, Vol. 820, pages 532-543. Springer-Verlag, Berlin, 1994. Journal version to appear in SIAM Journal on Discrete Mathematics.
17. R. Yuster and U. Zwick. Finding even cycles even faster. Proceedings of the 21st International Colloquium on Automata, Languages and Programming, Jerusalem. Lecture Notes in Computer Science, Vol. 820, pages 532-543. Springer-Verlag, Berlin, 1994. Journal version to appear in SIAM Journal on Discrete Mathematics.