We describe efficient algorithms for finding even cycles in undirected graphs. Our main results are the following: For every k ≥ 2, we can, in O(V2) time, decide whether an undirected graph G=(V, E) contains a simple cycle of length 2k and output such a cycle if it does. We can, again in O(V2) time, find a shortest even cycle in an undirected graph G=(V, E).
CITATION STYLE
Yuster, R., & Zwick, U. (1994). Finding even cycles even faster. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 820 LNCS, pp. 532–543). Springer Verlag. https://doi.org/10.1007/3-540-58201-0_96
Mendeley helps you to discover research relevant for your work.