Finding even cycles even faster

Raphael Yuster, Uri Zwick

Research output: Contribution to journalArticlepeer-review


We describe efficient algorithms for finding even cycles in undirected graphs. Our main results are the following: (i) For every k ≥ 2, there is an O(V2) time algorithm that decides whether an undirected graph G = (V, E) contains a simple cycle of length 2k, and finds one if it does. (ii) There is an O(V2) time algorithm that finds a shortest even cycle in an undirected graph G = (V, E).

Original languageEnglish
Pages (from-to)209-222
Number of pages14
JournalSIAM Journal on Discrete Mathematics
Issue number2
StatePublished - May 1997
Externally publishedYes


  • Cycles
  • Graph algorithms

ASJC Scopus subject areas

  • General Mathematics


Dive into the research topics of 'Finding even cycles even faster'. Together they form a unique fingerprint.

Cite this