scientific article; zbMATH DE number 6863595

MaRDI QIDQ4635977zbMATH OpenFDO

Authors

Publication date 23 April 2018

zbMATH Keywords

PC-tree algorithmS\&H algorithm

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• The complexity of planarity testing
• The complexity of planarity testing
• Planarity testing revisited
• scientific article; zbMATH DE number 3960992
• Hierarchical planarity testing algorithms
• scientific article; zbMATH DE number 4049078
• Orthogonal planarity testing of bounded treewidth graphs
• Planarity algorithms via PQ-trees (extended abstract)
• Incremental convex planarity testing
• Testing planarity of partially embedded graphs

Cited in

(7)

• A new planarity test
• A Planarity Test via Construction Sequences
• The complexity of planarity testing
• Fast incremental planarity testing
• Practical Experience with Hanani-Tutte for Testing c-Planarity
• Planarity algorithms via PQ-trees (extended abstract)
• Graph Drawing

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 Q4635977)