Computing the girth of a planar graph

DOI10.1007/3-540-45022-X_69MaRDI QIDQ2754199zbMATH OpenFDO

Authors Hristo N. Djidjev

Publication date 11 November 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45022-X_69

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• A faster algorithm for computing the girth of planar and bounded genus graphs
• Computing the girth of a planar graph in O(n n) time
• Computing the Girth of a Planar Graph in O(n logn) Time

Cited in

(8)

• On approximating the \(d\)-girth of a graph
• A faster algorithm for computing the girth of planar and bounded genus graphs
• Computing the Girth of a Planar Graph in O(n logn) Time
• Computing the girth of a planar graph in O(n n) time
• Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs
• Improved algorithms for perfect graphs and odd holes
• On the negative cost girth problem in planar networks
• Efficient approximation algorithms for shortest cycles in undirected graphs

This page was built for publication: Computing the girth of a planar graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2754199)