scientific article; zbMATH DE number 1305401

MaRDI QIDQ4252282zbMATH OpenFDO

Authors John M. Boyer, Wendy Myrvold

Publication date 17 June 1999

zbMATH Keywords

PQ-tree

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A linear algorithm for embedding planar graphs using PQ-trees
• Planarity algorithms via PQ-trees (extended abstract)
• Planar embedding: linear-time algorithms for vertex placement and edge orderings
• A new planarity test
• On the Cutting Edge: Simplified O(n) Planarity by Edge Addition

Cited in

(15)

• A linear algorithm for embedding planar graphs using PQ-trees
• A large set of torus obstructions and how they were discovered
• Disk embeddings of planar graphs
• Conformal spherical representation of 3D genus-zero meshes
• Heuristics for the maximum outerplanar subgraph problem
• On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
• scientific article; zbMATH DE number 3968607 (Why is no real title available?)
• Planar embedding: linear-time algorithms for vertex placement and edge orderings
• A practical algorithm for the computation of the genus
• Graph Drawing
• Planarity algorithms via PQ-trees (extended abstract)
• New facets for the planar subgraph polytope
• Efficient Extraction of Multiple Kuratowski Subdivisions
• Graph Drawing
• An annotated review on graph drawing and its applications

This page was built for publication:

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