Finding and counting given length cycles
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.
Unable to display preview. Download preview PDF.
- [AYZ94]N. Alon, R. Yuster, and U. Zwick. Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing, Montréal, Canada, pages 326–335, 1994.Google Scholar
- [Bol78]B. Bollobás. Extremal graph theory. Academic Press, 1978.Google Scholar
- [YZ94]R. Yuster and U. Zwick. Finding even cycles even faster. In Proceedings of the 21st International Colloquium on Automata, Languages and Programming, Jerusalem, Israel, 1994. To appear.Google Scholar