Embeddings of planar graphs that minimize the number of long-face cycles

DOI10.1016/S0167-6377(02)00119-0zbMath1010.90090OpenAlexW2112435812MaRDI QIDQ1866981

Gerhard J. Woeginger

Publication date: 2 April 2003

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(02)00119-0

zbMATH Keywords

computational complexityplanar graphgraph drawing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Complexity and performance of numerical algorithms (65Y20)

Related Items (2)

Planar Embeddings with Small and Uniform Faces ⋮ Approximation Algorithms for Facial Cycles in Planar Embeddings

Cites Work

• Face covers and the genus problem for apex graphs
• How to Draw a Graph
• Unnamed Item

This page was built for publication: Embeddings of planar graphs that minimize the number of long-face cycles