Computing optimal embeddings for planar graphs

DOI10.1007/3-540-44968-X_10MaRDI QIDQ2766818zbMATH OpenFDO

Authors Petra Mutzel, René Weiskircher

Publication date 22 July 2002

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

Full work available at URL https://doi.org/10.1007/3-540-44968-X_10

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Optimizing over all combinatorial embeddings of a planar graph. (Extended abstract)
• Graph Drawing
• Maximum planar subgraphs and nice embeddings: Practical layout tools
• On the complexity of embedding planar graphs to minimize certain distance measures
• Embedding planar graphs at fixed vertex locations

Cited in

(14)

• Embedding complexity and discrete optimization. I: A new divide and conquer approach to discrete optimization
• Planarity-preserving clustering and embedding for large planar graphs
• Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations
• Planar embeddings with small and uniform faces
• scientific article; zbMATH DE number 3843669 (Why is no real title available?)
• Optimal enclosing regions in planar graphs
• scientific article; zbMATH DE number 4128415 (Why is no real title available?)
• Optimizing over all combinatorial embeddings of a planar graph. (Extended abstract)
• Boolean approach to planar embeddings of a graph
• Planarity-preserving clustering and embedding for large planar graphs
• scientific article; zbMATH DE number 3995712 (Why is no real title available?)
• Bijective comparison of optimal planarity algorithms
• Ranking and unranking of the planar embeddings of a planar graph
• On simultaneous planar graph embeddings

This page was built for publication: Computing optimal embeddings for planar graphs

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