Abstract
Hierarchical graphs are an important class of graphs for modelling many real applications in software and information visualization. In this paper, we shall investigate the computational complexity of constructing minimum area grid visibility representations of hierarchically planar graphs. Firstly, we provide a quadratic algorithm that minimizes the drawing area with respect to a fixed planar embedding. This implies that the area minimization problem is polynomial time solvable restricted to the class of graphs whose planar embeddings are unique. Secondly, we show that the area minimization problem is generally NP-hard.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. A. Bondy and U. S. R. Murty, Graph Theory with Application, The Macmilan Press LTD, 1977.
G. Di Battista, P. D. Eades, R. Tamassia, and I. Tollis, Algorithms for Automatic Graph Drawing: An Annotated Bibliography, Computational Geometry: Theory and Application, 4, 235–282, 1994.
G. Di Battista and E. Nardelli, Hierarchies and Planarity Theory, IEEE Tran. Sys. Man Cybern. 18(6), 1035–1046, 1988.
G. Di Battista and R. Tamassia, Algorithms for Plane Representations of Acyclic Digraphs, Theoretical Computer Science, 61, 175–198, 1988.
G. Di Battista and R. Tamassia, On-Line Planarity Testing, SIAM Journal on Computing, 25(5), 1996.
G. Di Battista, R. Tamassia, and I. G. Tollis, Area Requirement and Symmetry Display of Planar Upward Drawings, Discrete & Computational Geometry, 7(381-401), 1992.
P. Eades, Q. Feng, X. Lin, and H. Nagamocha, Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs, to appear in Algorithmic.
P. Eades, X. Lin and R. Tamassia, An Algorithm for Drawing a Hierarchical Graph, International Journal of Computational Geometry and Applications, 6(2), 145–155, 1996.
M. R. Garey and D. S. Johnson, Computers and Intractability — a guide to the theory of NP-Completeness, Freeman, 1979.
A. Garg and R. Tamassia, On the Computational Complexity of Upward and Rectilinear Planarity Testing, Graph Drawing'94, LNCS, Springer-Verlag, 286–297, 1995.
L. S. Heath and S. V. Pemmaraju, Recognizing Leveled-Planar Dags in Linear Time, Graph Drawing'95, LNCS 1027, Springer-Verlag, 1995.
X. Lin, Analysis of Algorithms for Drawing Graphs, PHD thesis, University of Queensland, 1992.
X. Lin and P. Eades, Area Requirements for Drawing Hierarchically Planar Graphs, Graph Drawing'97, LNCS, Springer-Verlag, 1997.
X. Lin and P. Eades, Towards Area Requirements for Drawing Hierarchically Planar Graphs, Manuscript, UNSW, 1998.
R. Tamassia, On Embedding a Graph in the Grid with the Minimum Number of Bends, SIAM J. Computing 16(3), 421–444, 1987.
R. Tamassia and I. G. Tollis, Tesselation Representations of Planar Graphs, Proc. 27th Annual Allerton Conf, 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lin, X., Eades, P. (1999). Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs. In: Asano, T., Imai, H., Lee, D.T., Nakano, Si., Tokuyama, T. (eds) Computing and Combinatorics. COCOON 1999. Lecture Notes in Computer Science, vol 1627. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48686-0_9
Download citation
DOI: https://doi.org/10.1007/3-540-48686-0_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66200-6
Online ISBN: 978-3-540-48686-2
eBook Packages: Springer Book Archive