Finding even cycles even faster

Raphael Yuster; Uri Zwick

doi:10.1007/3-540-58201-0_96

Finding even cycles even faster

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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(V²) 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(V²) time, find a shortest even cycle in an undirected graph G=(V, E).

Original language	English
Title of host publication	Automata, Languages and Programming - 21st International Colloquium, ICALP 1994, Proceedings
Editors	Serge Abiteboul, Eli Shamir
Publisher	Springer Verlag
Pages	532-543
Number of pages	12
ISBN (Print)	9783540582014
DOIs	https://doi.org/10.1007/3-540-58201-0_96
State	Published - 1994
Externally published	Yes
Event	Proceedings of the 1994 21st International Colloquium on Automata, Languages and Programming, ICALP'94 - Jerusalem, Isr Duration: 1 Jul 1994 → 1 Jul 1994

Publication series

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

Conference

Conference	Proceedings of the 1994 21st International Colloquium on Automata, Languages and Programming, ICALP'94
City	Jerusalem, Isr
Period	1/07/94 → 1/07/94

Bibliographical note

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

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/3-540-58201-0_96

Cite this

Yuster, R., & Zwick, U. (1994). Finding even cycles even faster. In S. Abiteboul, & E. Shamir (Eds.), Automata, Languages and Programming - 21st International Colloquium, ICALP 1994, Proceedings (pp. 532-543). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 820 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-58201-0_96

@inproceedings{8ea0252f80644bd0812beda0b78df996,

title = "Finding even cycles even faster",

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

author = "Raphael Yuster and Uri Zwick",

note = "Publisher Copyright: {\textcopyright} 1994, Springer Verlag. All rights reserved.; Proceedings of the 1994 21st International Colloquium on Automata, Languages and Programming, ICALP'94 ; Conference date: 01-07-1994 Through 01-07-1994",

year = "1994",

doi = "10.1007/3-540-58201-0_96",

language = "English",

isbn = "9783540582014",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "532--543",

editor = "Serge Abiteboul and Eli Shamir",

booktitle = "Automata, Languages and Programming - 21st International Colloquium, ICALP 1994, Proceedings",

address = "Germany",

}

Yuster, R & Zwick, U 1994, Finding even cycles even faster. in S Abiteboul & E Shamir (eds), Automata, Languages and Programming - 21st International Colloquium, ICALP 1994, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 820 LNCS, Springer Verlag, pp. 532-543, Proceedings of the 1994 21st International Colloquium on Automata, Languages and Programming, ICALP'94, Jerusalem, Isr, 1/07/94. https://doi.org/10.1007/3-540-58201-0_96

Finding even cycles even faster. / Yuster, Raphael; Zwick, Uri.
Automata, Languages and Programming - 21st International Colloquium, ICALP 1994, Proceedings. ed. / Serge Abiteboul; Eli Shamir. Springer Verlag, 1994. p. 532-543 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 820 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Finding even cycles even faster

AU - Yuster, Raphael

AU - Zwick, Uri

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 - Conference contribution

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

T2 - Proceedings of the 1994 21st International Colloquium on Automata, Languages and Programming, ICALP'94

Y2 - 1 July 1994 through 1 July 1994

ER -

Yuster R, Zwick U. Finding even cycles even faster. In Abiteboul S, Shamir E, editors, Automata, Languages and Programming - 21st International Colloquium, ICALP 1994, Proceedings. Springer Verlag. 1994. p. 532-543. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-58201-0_96

Finding even cycles even faster

Abstract

Publication series

Conference

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this