Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

ICALP
2000
Springer

favoriteEmaildiscussreport

124views Programming Languages» more ICALP 2000»

Computing the Girth of a Planar Graph

13 years 8 months ago

Computing the Girth of a Planar Graph

Download research.haifa.ac.il

We give an O(n log n) 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. Key words. Girth, shortest cycle, planar graph, graphs of bounded genus AMS subject classifications. 05C38, 68R10

Hristo Djidjev

Real-time Traffic

ICALP 2000 | N-vertex Planar Graph | Planar Graph | Programming Languages | Shortest Cycle |

claim paper

Related Content

» nTuple Coloring of Planar Graphs with Large Odd Girth

» An improved bound on the largest induced forests for trianglefree planar graphs

» Coloring squares of planar graphs with girth six

» Group chromatic number of planar graphs of girth at least 4

» Subgraph Isomorphism in Planar Graphs and Related Problems

» Nonhamiltonian 3Connected Cubic Planar Graphs

» UpEmbeddability of a Graph by Order and Girth

» Domination in Graphs of Minimum Degree at least Two and Large Girth

» Two New Classes of Hamiltonian Graphs Extended Abstract

Post Info
More Details (n/a)

Added	24 Aug 2010
Updated	24 Aug 2010
Type	Conference
Year	2000
Where	ICALP
Authors	Hristo Djidjev

Comments (0)