Constant Time Generation of Biconnected Rooted Plane Graphs

DOI10.1007/978-3-642-14553-7_13MaRDI QIDQ3587341zbMATH OpenOpenAlexFDO

Authors Bingbing Zhuang, Hiroshi Nagamochi

Publication date 7 September 2010

Published in Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14553-7_13

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• Fast generation of some classes of planar graphs
• Fast generation of planar graphs
• Generation of Graphs with Bounded Branchwidth
• scientific article; zbMATH DE number 434865
• Generating internally triconnected rooted plane graphs
• A square time algorithm for cyclic edge connectivity of planar graphs.
• Short path queries in planar graphs in constant time
• Generating All Triangulations of Plane Graphs (Extended Abstract)
• scientific article; zbMATH DE number 1947450
• Planar graph bipartization in linear time

Cited in

(6)

• Listing All Plane Graphs
• An Efficient Algorithm for Generating Colored Outerplanar Graphs
• Listing All Plane Graphs
• Enumerating rooted graphs with reflectional block structures
• Generating internally triconnected rooted plane graphs
• Listing triconnected rooted plane graphs

This page was built for publication: Constant Time Generation of Biconnected Rooted Plane Graphs

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