Abstract
An algorithm for k-line planarity testing of hierarchical graphs is described. If the graph is k-line planar the algorithm produces the corresponding embedding. The algorithm has time complexity O(∣V∣). Furthermore some forbidden patterns are identified, whose existence is necessary and sufficient for a hierarchical graph to be not k-line planar.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K.S.Booth, G.S.Lueker — Testing for the consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms. Journal of Computer and System Sciences 13, 1976.
S.Ceri (ed.) — Methodology and Tools for Data Base Design. North Holland, 1983.
A.Shoshani — Statistical Databases: Characteristics, Problems, and Some Solutions. 8th International Conference on Very Large Data Bases, 1982.
D.S. Johnson — The NP-Completeness Column: An Ongoing Guide. Journal of Algorithms, vol.3, pg.97, 1982.
J.N.Warfield — Crossing Theory and Hierarchy Mapping. IEEE Transactions on Systems, Man, and Cybernetics, vol.SMC-7, no.7, July 1977.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Battista, G., Nardelli, E. (1987). An algorithm for testing planarity of hierarchical graphs. In: Tinhofer, G., Schmidt, G. (eds) Graph-Theoretic Concepts in Computer Science. WG 1986. Lecture Notes in Computer Science, vol 246. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17218-1_65
Download citation
DOI: https://doi.org/10.1007/3-540-17218-1_65
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17218-5
Online ISBN: 978-3-540-47415-9
eBook Packages: Springer Book Archive