scientific article; zbMATH DE number 434911

MaRDI QIDQ3139767zbMATH OpenFDO

Authors Almira Karabeg

Publication date 17 May 1994

zbMATH Keywords

orderingembeddingsPQ-treesplanar embeddings

Mathematics Subject Classification ID

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

Recommendations

• A linear algorithm for embedding planar graphs using PQ-trees
• Ranking and unranking planar embeddings
• Planarity algorithms via PQ-trees (extended abstract)
• Counting Embeddings of Planar Graphs Using DFS Trees
• Planar embedding: linear-time algorithms for vertex placement and edge orderings

Cited in

(4)

• Planar embedding: linear-time algorithms for vertex placement and edge orderings
• Counting Embeddings of Planar Graphs Using DFS Trees
• On counting planar embeddings
• Ranking and unranking planar embeddings

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