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

Oren Weimann; Raphael Yuster

doi:10.1007/978-3-642-02927-1_63

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

Oren Weimann, Raphael Yuster

Department of Mathematics

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

Abstract

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.

Original language	English
Title of host publication	Automata, Languages and Programming - 36th International Colloquium, ICALP 2009, Proceedings
Pages	764-773
Number of pages	10
Edition	PART 1
DOIs	https://doi.org/10.1007/978-3-642-02927-1_63
State	Published - 2009
Event	36th International Colloquium on Automata, Languages and Programming, ICALP 2009 - Rhodes, Greece Duration: 5 Jul 2009 → 12 Jul 2009

Publication series

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

Conference

Conference	36th International Colloquium on Automata, Languages and Programming, ICALP 2009
Country/Territory	Greece
City	Rhodes
Period	5/07/09 → 12/07/09

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

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

Cite this

Weimann, O., & Yuster, R. (2009). Computing the girth of a planar graph in O(n logn) time. In Automata, Languages and Programming - 36th International Colloquium, ICALP 2009, Proceedings (PART 1 ed., pp. 764-773). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5555 LNCS, No. PART 1). https://doi.org/10.1007/978-3-642-02927-1_63

@inproceedings{d37638844c4b4341ad870e524c70c8d2,

title = "Computing the girth of a planar graph in O(n logn) time",

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

author = "Oren Weimann and Raphael Yuster",

year = "2009",

doi = "10.1007/978-3-642-02927-1_63",

language = "English",

isbn = "3642029264",

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

number = "PART 1",

pages = "764--773",

booktitle = "Automata, Languages and Programming - 36th International Colloquium, ICALP 2009, Proceedings",

edition = "PART 1",

note = "36th International Colloquium on Automata, Languages and Programming, ICALP 2009 ; Conference date: 05-07-2009 Through 12-07-2009",

}

Weimann, O & Yuster, R 2009, Computing the girth of a planar graph in O(n logn) time. in Automata, Languages and Programming - 36th International Colloquium, ICALP 2009, Proceedings. PART 1 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 1, vol. 5555 LNCS, pp. 764-773, 36th International Colloquium on Automata, Languages and Programming, ICALP 2009, Rhodes, Greece, 5/07/09. https://doi.org/10.1007/978-3-642-02927-1_63

Computing the girth of a planar graph in O(n logn) time. / Weimann, Oren ; Yuster, Raphael.
Automata, Languages and Programming - 36th International Colloquium, ICALP 2009, Proceedings. PART 1. ed. 2009. p. 764-773 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5555 LNCS, No. PART 1).

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

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 -

Weimann O , Yuster R. Computing the girth of a planar graph in O(n logn) time. In Automata, Languages and Programming - 36th International Colloquium, ICALP 2009, Proceedings. PART 1 ed. 2009. p. 764-773. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1). doi: 10.1007/978-3-642-02927-1_63

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

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this