Practical level planarity testing and layout with embedding constraints

Authors:
Martin Harrigan;Patrick Healy
Affiliations:
Department of Computer Science and Information Systems, University of Limerick, Ireland;Department of Computer Science and Information Systems, University of Limerick, Ireland
Venue:
GD'07 Proceedings of the 15th international conference on Graph drawing
Year:
2007

Citing 4
Cited 3

A linear algorithm for embedding planar graphs using PQ-trees

Journal of Computer and System Sciences
Recognizing Leveled-Planar Dags in Linear Time

GD '95 Proceedings of the Symposium on Graph Drawing
Algorithms for multi-level graph planarity testing and layout

Theoretical Computer Science
Planarity testing and optimal edge insertion with embedding constraints

GD'06 Proceedings of the 14th international conference on Graph drawing

Graph Simultaneous Embedding Tool, GraphSET

Graph Drawing
Characterization of unlabeled level planar trees

Computational Geometry: Theory and Applications
Drawing layered graphs with port constraints

Journal of Visual Languages and Computing

Quantified Score

Hi-index	0.00

Visualization

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.