Abstract
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.
Work supported in part by THE BASIC RESEARCH FOUNDATION administrated by THE ISRAEL ACADEMY OF SCIENCES AND HUMANITIES.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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.
B. Bollobás. On generalized graphs. Acta Math. Acad. Sci. Hungar., 16:447–452, 1965.
B. Bollobás. Extremal graph theory. Academic Press, 1978.
J.A. Bondy and M. Simonovits. Cycles of even length in graphs. Journal of Combinatorial Theory, Series B, 16:97–105, 1974.
N. Chiba and L. Nishizeki. Arboricity and subgraph listing algorithms. SIAM Journal on Computing, 14:210–223, 1985.
A. Itai and M. Rodeh. Finding a minimum circuit in a graph. SIAM Journal on Computing, 7:413–423, 1978.
D.W. Matula and L.L. Beck. Smallest-last ordering and clustering and graph coloring algorithms. Journal of the ACM, 30:417–427, 1983.
B. Monien. How to find long paths efficiently. Annals of Discrete Mathematics, 25:239–254, 1985.
J. Nešetřil and S. Poljak. On the complexity of the subgraph problem. Commentationes Mathematicae Universitatis Carolinae, 26(2):415–419, 1985.
C.H. Papadimitriou and M. Yannakakis. The clique problem for planar graphs. Information Processing Letters, 13:131–133, 1981.
D. Richards. Finding short cycles in a planar graph using separators. Journal of Algorithms, 7:382–394, 1986.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alon, N., Yuster, R., Zwick, U. (1994). Finding and counting given length cycles. In: van Leeuwen, J. (eds) Algorithms — ESA '94. ESA 1994. Lecture Notes in Computer Science, vol 855. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0049422
Download citation
DOI: https://doi.org/10.1007/BFb0049422
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58434-6
Online ISBN: 978-3-540-48794-4
eBook Packages: Springer Book Archive