Abstract
We describe a practical method to test a leveled graph for level planarity and provide a level planar layout of the graph if the test succeeds, all in quadratic running-time. Embedding constraints restricting the order of incident edges around the vertices are allowed.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Chiba, N., Nishizeki, T., Abe, S., Ozawa, T.: A Linear Algorithm for Embedding Planar Graphs using PQ-Trees. Journal of Comp. and Sys. Sci. 30(1), 54–76 (1985)
Di Battista, G., Nardelli, E.: Hierarchies and Planarity Theory. IEEE Trans. Sys., Man and Cybern. 18(6), 1035–1046 (1988)
Gutwenger, C., Klein, K., Mutzel, P.: Planarity Testing and Optimal Edge Insertion with Embedding Constraints. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 126–137. Springer, Heidelberg (2007)
Healy, P., Kuusik, A.: Algorithms for Multi-Level Graph Planarity Testing and Layout. Theor. Comp. Sci. 320(2-3), 331–344 (2004)
Heath, L., Pemmaraju, S.: Recognizing Leveled-Planar DAGs in Linear Time. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol. 1027, pp. 300–311. Springer, Heidelberg (1996)
Jünger, M., Leipert, S.: Level Planar Embedding in Linear Time. Journal of Graph Alg. and App. 6(1), 67–113 (2002)
Randerath, B., Speckenmeyer, E., Boros, E., Hammer, P., Kogan, A., Makino, K., Simeone, B., Cepek, O.: A Satisfiability Formulation of Problems on Level Graphs. Technical report 40-2001, Rutgers Center for Operations Research, Rutgers University (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Harrigan, M., Healy, P. (2008). Practical Level Planarity Testing and Layout with Embedding Constraints. In: Hong, SH., Nishizeki, T., Quan, W. (eds) Graph Drawing. GD 2007. Lecture Notes in Computer Science, vol 4875. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77537-9_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-77537-9_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77536-2
Online ISBN: 978-3-540-77537-9
eBook Packages: Computer ScienceComputer Science (R0)