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

Authors:
Mohammad Khairul Hasan;Sung-Eui Yoon;Kyung-Yong Chwa
Affiliations:
Division of Computer Science, Korea Advanced Institute of Science and Technology (KAIST), Republic of Korea;Division of Computer Science, Korea Advanced Institute of Science and Technology (KAIST), Republic of Korea;Division of Computer Science, Korea Advanced Institute of Science and Technology (KAIST), Republic of Korea
Venue:
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Year:
2009

Citing 15
Cited 0

The input/output complexity of sorting and related problems

Communications of the ACM
Digital halftoning with space filling curves

Proceedings of the 18th annual conference on Computer graphics and interactive techniques
Edge separators of planar and outerplanar graphs with applications

Journal of Algorithms
Approximating layout problems on random geometric graphs

Journal of Algorithms
A survey of graph layout problems

ACM Computing Surveys (CSUR)
Global static indexing for real-time exploration of very large regular grids

Proceedings of the 2001 ACM/IEEE conference on Supercomputing
Visualization of large terrains made easy

Proceedings of the conference on Visualization '01
Some simplified NP-complete problems

STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Structural and algorithmic aspects of massive social networks

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Cache-oblivious mesh layouts

ACM SIGGRAPH 2005 Papers
Mesh Layouts for Block-Based Caches

IEEE Transactions on Visualization and Computer Graphics
Computer Architecture, Fourth Edition: A Quantitative Approach

Computer Architecture, Fourth Edition: A Quantitative Approach
An improved approximation ratio for the minimum linear arrangement problem

Information Processing Letters
Approximation algorithms for geometric embeddings in the plane with applications to parallel processing problems

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
On the metric properties of discrete space-filling curves

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Data access time becomes the main bottleneck in applications dealing with large-scale graphs. Cache-oblivious layouts, constructed to minimize the geometric mean of arc lengths of graphs, have been adapted to reduce data access time during random walks on graphs. In this paper, we present a constant factor approximation algorithm for the Minimum Geometric Mean Layout (MGML) problem for bounded-degree planar graphs. We also derive an upper bound for any layout of the MGML problem. To the best of our knowledge, these are the first results for the MGML problem with bounded-degree planar graphs.