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

DOI10.1007/978-3-642-02270-8_17MaRDI QIDQ5321706zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• Approximating layout problems on random geometric graphs
• scientific article; zbMATH DE number 1420916
• Approximating layout problems on random graphs
• Automata, Languages and Programming
• Optimal cache-oblivious mesh layouts

Cites work

• A Separator Theorem for Planar Graphs
• An improved approximation ratio for the minimum linear arrangement problem
• Approximating layout problems on random geometric graphs
• Complexity Results for Bandwidth Minimization
• Edge Separators of Planar and Outerplanar Graphs With Applications
• scientific article; zbMATH DE number 3700882 (Why is no real title available?)
• scientific article; zbMATH DE number 53772 (Why is no real title available?)
• scientific article; zbMATH DE number 3526692 (Why is no real title available?)
• scientific article; zbMATH DE number 6469213 (Why is no real title available?)
• Preserving order in a forest in less than logarithmic time and linear space
• Some simplified NP-complete graph problems
• Space-filling curves
• The NP-completeness of the bandwidth minimization problem

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

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