Optimizing over all combinatorial embeddings of a planar graph. (Extended abstract)

DOI10.1007/3-540-48777-8_27MaRDI QIDQ4263724zbMATH OpenFDO

Authors Petra Mutzel, René Weiskircher

Publication date 27 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-48777-8_27

zbMATH Keywords

combinatorial embeddingsinteger linear programsplanar graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Computing optimal embeddings for planar graphs
• Graph Drawing
• Maximum planar subgraphs and nice embeddings: Practical layout tools

Cited in

(6)

• Embeddings of planar graphs that minimize the number of long-face cycles
• Computing optimal embeddings for planar graphs
• Planar embeddings with small and uniform faces
• Approximation Algorithms for Facial Cycles in Planar Embeddings
• New methods for finding minimum genus embeddings of graphs on orientable and non-orientable surfaces
• Ranking and unranking of the planar embeddings of a planar graph

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: Optimizing over all combinatorial embeddings of a planar graph. (Extended abstract)

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