Graph embedding with topological cycle-constraints

DOI10.1007/3-540-46648-7_16MaRDI QIDQ4501701zbMATH OpenFDO

Authors Christoph Dornheim

Publication date 16 November 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46648-7_16

zbMATH Keywords

efficient algorithmgraph embeddingNP-completeplanar embeddingtopological constraints

Mathematics Subject Classification ID

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

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)

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

This page was built for publication: Graph embedding with topological cycle-constraints

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