Finding even cycles even faster

Raphael Yuster; Uri Zwick

doi:10.1137/S0895480194274133

Finding even cycles even faster

Research output: Contribution to journal › Article › peer-review

Abstract

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(V²) 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(V²) time algorithm that finds a shortest even cycle in an undirected graph G = (V, E).

Original language	English
Pages (from-to)	209-222
Number of pages	14
Journal	SIAM Journal on Discrete Mathematics
Volume	10
Issue number	2
DOIs	https://doi.org/10.1137/S0895480194274133
State	Published - May 1997
Externally published	Yes

Keywords

Cycles
Graph algorithms

ASJC Scopus subject areas

General Mathematics

Access to Document

10.1137/S0895480194274133

Cite this

@article{27173cf066c24d258598803b85fc802c,

title = "Finding even cycles even faster",

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

keywords = "Cycles, Graph algorithms",

author = "Raphael Yuster and Uri Zwick",

year = "1997",

month = may,

doi = "10.1137/S0895480194274133",

language = "English",

volume = "10",

pages = "209--222",

journal = "SIAM Journal on Discrete Mathematics",

issn = "0895-4801",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "2",

}

TY - JOUR

T1 - Finding even cycles even faster

AU - Yuster, Raphael

AU - Zwick, Uri

PY - 1997/5

Y1 - 1997/5

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

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

KW - Cycles

KW - Graph algorithms

UR - https://www.scopus.com/pages/publications/0038230478

U2 - 10.1137/S0895480194274133

DO - 10.1137/S0895480194274133

M3 - Article

AN - SCOPUS:0038230478

SN - 0895-4801

VL - 10

SP - 209

EP - 222

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

IS - 2

ER -

Finding even cycles even faster

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this