scientific article; zbMATH DE number 1500680

MaRDI QIDQ4501701zbMATH OpenFDO

Authors Christoph Dornheim

Publication date 16 November 2000

zbMATH Keywords

graph embeddingNP-completeefficient algorithmtopological constraintsplanar embedding

Mathematics Subject Classification ID

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

Recommendations

• Planar Graphs with Topological Constraints
• Common-Face Embeddings of Planar Graphs
• Planarity Testing and Optimal Edge Insertion with Embedding Constraints
• Graph Drawing

Cited in

(6)

• Planarity Testing and Optimal Edge Insertion with Embedding Constraints
• Separating and nonseparating disjoint homotopic cycles in graph embeddings
• Common-Face Embeddings of Planar Graphs
• Embedding a triangular graph within a given boundary
• Planar Graphs with Topological Constraints
• Approximation Algorithms for Facial Cycles in 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 Q4501701)