Abstract
In this paper, we introduce a new graph model known as clustered graphs, i.e. graphs with recursive clustering structures. This graph model has many applications in informational and mathematical sciences. In particular, we study C-planarity of clustered graphs. Given a clustered graph, the C-planarity testing problem is to determine whether the clustered graph can be drawn without edge crossings, or edge-region crossings. In this paper, we present efficient algorithms for testing C-planarity and finding C-planar embeddings of clustered graphs.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.
G. Di Battista, P. Eades, R. Tamassia, and I. Tollis. Algorithms for drawing graphs: An annotated bibliography. Technical report, Department of Computer Science, Brown University, 1993. To appear in Computational Geometry and Applications, currently available from wilma.cs.brown.edu by ftp.
Claude Berge. Hypergraphs. North-Holland, 1989.
K. Booth and G. Lueker. Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. Journal of Computer and System Sciences, 13:335–379, 1976.
N. Chiba, T. Nishizeki, S. Abe, and T. Ozawa. A linear algorithm for embedding planar graphs using PQ-trees. J. of Computer and Sytem Sciences, 30(1):54–76, 1985.
H. de Fraysseix and P. Rosenstiehl. A depth-first-search characterization of planarity. Annals of Discrete Mathematics, 13:75–80, 1982.
S. Even and R. E. Tarjan. Computing an st-numbering. Theoretical Computer Science, 2:339–344, 1976.
M.R. Garey and D.S. Johnson. Crossing number is NP-complete. SIAM J. Algebraic and Discrete Methods, 4(3):312–316, 1983.
D. Harel. On visual formalisms. Communications of the ACM, 31(5):514–530, 1988.
J. Hopcroft and R. E. Tarjan. Efficient planarity testing. Journal of ACM, 21(4):549–568, 1974.
T. Kamada. Visualizing Abstract Objects and Relations. World Scientific Series in Computer Science, 1989.
J. Kawakita. The KJ method — a scientific approach to problem solving. Technical report, Kawakita Research Institute, Tokyo, 1975.
Wei Lai. Building Interactive Digram Applications. PhD thesis, Department of Computer Science, University of Newcastle, Callaghan, New South Wales, Australia, 2308, June 1993.
A. Lempel, S. Even, and I. Cederbaum. An algorithm for planarity testing of graphs. In Theory of Graphs, International Symposium (Rome 1966), pages 215–232. Gordon and Breach, New York, 1967.
T. Nishizeki and N. Chiba. Planar Graphs: Theory and Algorithms, Annals of Discrete Mathematics 32. North-Holland, 1988.
S. C. North. Drawing ranked digraphs with recursive clusters. preprint, 1993. Software Systems and Research Center, AT & T Laboratories.
K. Sugiyama and K. Misue. Visualization of structural information: Automatic drawing of compound digraphs. IEEE Transactions on Systems, Man and Cybernetics, 21(4):876–892, 1991.
C. Williams, J. Rasure, and C. Hansen. The state of the art of visual languages for visualization. In Visualization 92, pages 202–209, 1992.
Rebecca Wirfs-Brock, Brian Wilkerson, and Lauren Wiener. Designing Object-Oriented Software. P T R Prentics Hall, Englewood Cliffs, NJ 07632, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Feng, QW., Cohen, R.F., Eades, P. (1995). Planarity for clustered graphs. In: Spirakis, P. (eds) Algorithms — ESA '95. ESA 1995. Lecture Notes in Computer Science, vol 979. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60313-1_145
Download citation
DOI: https://doi.org/10.1007/3-540-60313-1_145
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60313-9
Online ISBN: 978-3-540-44913-3
eBook Packages: Springer Book Archive