Advertisement

Finding even cycles even faster

Extended abstract
  • Raphael Yuster
  • Uri Zwick
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 820)

Abstract

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).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [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, 1994.Google Scholar
  2. [Bol78]
    B. Bollobás. Extremal graph theory. Academic Press, 1978.Google Scholar
  3. [BS74]
    J.A. Bondy and M. Simonovits. Cycles of even length in graphs. Journal of Combinatorial Theory, Series B, 16:97–105, 1974.Google Scholar
  4. [IR78]
    A. Itai and M. Rodeh. Finding a minimum circuit in a graph. SIAM Journal on Computing, 7:413–423, 1978.Google Scholar
  5. [Lee90]
    J. van Leeuwen. Graph algorithms. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume A, Algorithms and Complexity, chapter 10, pages 525–631. Elsevier and The MIT Press, 1990.Google Scholar
  6. [Mon83]
    B. Monien. The complexity of determining a shortest cycle of even length. Computing, 31:355–369, 1983.Google Scholar
  7. [Mon85]
    B. Monien. How to find long paths efficiently. Annals of Discrete Mathematics, 25:239–254, 1985.Google Scholar
  8. [RL85]
    D. Richards and A.L. Liestman. Finding cycles of a given length. Annals of Discrete Mathematics, 27:249–256, 1985.Google Scholar
  9. [Tho85]
    C. Thomassen. Even cycles in directed graphs. European Journal of Combinatorics, 6:85–89, 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Raphael Yuster
    • 1
  • Uri Zwick
    • 1
  1. 1.Department of Computer ScienceTel Aviv UniversityTel AvivIsrael

Personalised recommendations