TY - GEN

T1 - Finding even cycles even faster

AU - Yuster, Raphael

AU - Zwick, Uri

N1 - Publisher Copyright:
© 1994, Springer Verlag. All rights reserved.

PY - 1994

Y1 - 1994

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

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

UR - http://www.scopus.com/inward/record.url?scp=85016204250&partnerID=8YFLogxK

U2 - 10.1007/3-540-58201-0_96

DO - 10.1007/3-540-58201-0_96

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85016204250

SN - 9783540582014

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

SP - 532

EP - 543

BT - Automata, Languages and Programming - 21st International Colloquium, ICALP 1994, Proceedings

A2 - Abiteboul, Serge

A2 - Shamir, Eli

PB - Springer Verlag

Y2 - 1 July 1994 through 1 July 1994

ER -