Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs

DOI10.1007/978-3-642-02270-8_17zbMath1248.68522OpenAlexW1602768168MaRDI QIDQ5321706

Mohammad Khairul Hasan, Kyung-Yong Chwa, Sung-eui Yoon

Publication date: 14 July 2009

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02270-8_17

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Approximation algorithms (68W25) Random walks on graphs (05C81)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved approximation ratio for the minimum linear arrangement problem
• The NP-completeness of the bandwidth minimization problem
• Some simplified NP-complete graph problems
• Preserving order in a forest in less than logarithmic time and linear space
• Space-filling curves
• Approximating Layout Problems on Random Geometric Graphs
• A Separator Theorem for Planar Graphs
• Edge Separators of Planar and Outerplanar Graphs With Applications
• Complexity Results for Bandwidth Minimization

This page was built for publication: Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs