Finding even cycles even faster

Raphael Yuster, Uri Zwick

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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

Original languageEnglish
Title of host publicationAutomata, Languages and Programming - 21st International Colloquium, ICALP 1994, Proceedings
EditorsSerge Abiteboul, Eli Shamir
PublisherSpringer Verlag
Pages532-543
Number of pages12
ISBN (Print)9783540582014
DOIs
StatePublished - 1994
Externally publishedYes
EventProceedings of the 1994 21st International Colloquium on Automata, Languages and Programming, ICALP'94 - Jerusalem, Isr
Duration: 1 Jul 19941 Jul 1994

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume820 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceProceedings of the 1994 21st International Colloquium on Automata, Languages and Programming, ICALP'94
CityJerusalem, Isr
Period1/07/941/07/94

Bibliographical note

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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

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

Cite this