We present an assortment of methods for finding and counting simple cycles of a given length in directed and undirected graphs. Most of the bounds obtained depend solely on the number of edges in the graph in question, and not on the number of vertices. The bounds obtained improve upon various previously known results.
Key WordsGraph algorithms Cycles
Unable to display preview. Download preview PDF.
- 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.Google Scholar
- 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.Google Scholar
- 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 Sciences Vol. 1017, pages 14–23. Springer-Verlag, 1995.Google Scholar
- 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 inSIAM Journal on Discrete Mathematics.Google Scholar