Finding even cycles even faster

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 820 LNCS, Issue , 1994, Pages 532-543

  Yuster, Raphael ^a   Zwick, Uri ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

EVEN CYCLES; UNDIRECTED GRAPH;

GRAPH THEORY;

EID: 85016204250     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58201-0_96     Document Type: Conference Paper

References (9)

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.
2. B. Bollobás. Extremal graph theory. Academic Press, 1978.
3. J.A. Bondy and M. Simonovits. Cycles of even length in graphs. Journal of Combinatorial Theory, Series B, 16:97-105, 1974.
4. A. Itai and M. Rodeh. Finding a minimum circuit in a graph. SIAM Journal on Computing, 7:413-423, 1978.
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.
6. B. Monien. The complexity of determining a shortest cycle of even length. Computing, 31:355-369, 1983.
7. B. Monien. How to find long paths efficiently. Annals of Discrete Mathematics, 25:239-254, 1985.
8. D. Richards and A.L. Liestman. Finding cycles of a given length. Annals of Discrete Mathematics, 27:249-256, 1985.
9. C. Thomassen. Even cycles in directed graphs. European Journal of Combinatorics, 6:85-89, 1985.