TY - GEN

T1 - Computing the girth of a planar graph in O(n logn) time

AU - Weimann, Oren

AU - Yuster, Raphael

PY - 2009

Y1 - 2009

N2 - We give an O(n logn) algorithm for computing the girth (shortest cycle) of an undirected n-vertex planar graph. Our solution extends to any graph of bounded genus. This improves upon the best previously known algorithms for this problem.

AB - We give an O(n logn) algorithm for computing the girth (shortest cycle) of an undirected n-vertex planar graph. Our solution extends to any graph of bounded genus. This improves upon the best previously known algorithms for this problem.

UR - http://www.scopus.com/inward/record.url?scp=70449111695&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-02927-1_63

DO - 10.1007/978-3-642-02927-1_63

M3 - Conference contribution

AN - SCOPUS:70449111695

SN - 3642029264

SN - 9783642029264

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 764

EP - 773

BT - Automata, Languages and Programming - 36th International Colloquium, ICALP 2009, Proceedings

T2 - 36th International Colloquium on Automata, Languages and Programming, ICALP 2009

Y2 - 5 July 2009 through 12 July 2009

ER -