Skip to main content
Conference ProceedingsOPEN ACCESS

Practical level planarity testing and layout with embedding constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 4875 LNCS 62-68
DOI: 10.1007/978-3-540-77537-9_9
13Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Harrigan, M., & Healy, P. (2008). Practical level planarity testing and layout with embedding constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4875 LNCS, pp. 62–68). https://doi.org/10.1007/978-3-540-77537-9_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free