Skip to main content
SpringerLink
Log in

Finding even cycles even faster

Extended abstract

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 820))

Included in the following conference series:

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(V 2) 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).

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.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. B. Bollobás. Extremal graph theory. Academic Press, 1978.

    Google Scholar 

  3. 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. A. Itai and M. Rodeh. Finding a minimum circuit in a graph. SIAM Journal on Computing, 7:413–423, 1978.

    Google Scholar 

  5. 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. B. Monien. The complexity of determining a shortest cycle of even length. Computing, 31:355–369, 1983.

    Google Scholar 

  7. B. Monien. How to find long paths efficiently. Annals of Discrete Mathematics, 25:239–254, 1985.

    Google Scholar 

  8. D. Richards and A.L. Liestman. Finding cycles of a given length. Annals of Discrete Mathematics, 27:249–256, 1985.

    Google Scholar 

  9. C. Thomassen. Even cycles in directed graphs. European Journal of Combinatorics, 6:85–89, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Tel Aviv University, 69978, Tel Aviv, Israel

    Raphael Yuster & Uri Zwick

Authors
  1. Raphael Yuster
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Uri Zwick
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Serge Abiteboul Eli Shamir

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yuster, R., Zwick, U. (1994). Finding even cycles even faster. In: Abiteboul, S., Shamir, E. (eds) Automata, Languages and Programming. ICALP 1994. Lecture Notes in Computer Science, vol 820. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58201-0_96

Download citation

  • DOI: https://doi.org/10.1007/3-540-58201-0_96

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58201-4

  • Online ISBN: 978-3-540-48566-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation