Computing the girth of a planar graph in o(n log n) time

Oren Weimann; Raphael Yuster

doi:10.1137/090767868

Computing the girth of a planar graph in o(n log n) time

Oren Weimann, Raphael Yuster

Department of Mathematics

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

Abstract

We give an O(n logn) algorithm for computi ng 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
Pages (from-to)	609-616
Number of pages	8
Journal	SIAM Journal on Discrete Mathematics
Volume	24
Issue number	2
DOIs	https://doi.org/10.1137/090767868
State	Published - 2010

Keywords

Girth
Graphs of bounded genus
Planar graph
Shortest cycle

ASJC Scopus subject areas

General Mathematics

Access to Document

10.1137/090767868

Cite this

@article{0ddb29b5117b424689336d08be80981f,

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

abstract = "We give an O(n logn) algorithm for computi ng 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.",

keywords = "Girth, Graphs of bounded genus, Planar graph, Shortest cycle",

author = "Oren Weimann and Raphael Yuster",

year = "2010",

doi = "10.1137/090767868",

language = "English",

volume = "24",

pages = "609--616",

journal = "SIAM Journal on Discrete Mathematics",

issn = "0895-4801",

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

number = "2",

}

TY - JOUR

T1 - Computing the girth of a planar graph in o(n log n) time

AU - Weimann, Oren

AU - Yuster, Raphael

PY - 2010

Y1 - 2010

N2 - We give an O(n logn) algorithm for computi ng 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 computi ng 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.

KW - Girth

KW - Graphs of bounded genus

KW - Planar graph

KW - Shortest cycle

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

U2 - 10.1137/090767868

DO - 10.1137/090767868

M3 - Article

AN - SCOPUS:77954511786

SN - 0895-4801

VL - 24

SP - 609

EP - 616

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

IS - 2

ER -

Computing the girth of a planar graph in o(n log n) time

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this