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 - http://www.scopus.com/inward/record.url?scp=0038230478&partnerID=8YFLogxK
U2 - 10.1137/S0895480194274133
DO - 10.1137/S0895480194274133
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.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 -