Algorithms for multi-level graph planarity testing and layout

Authors:
Patrick Healy;Ago Kuusik
Affiliations:
Department of Computer Science and Information Systems, Unversity of Limerick, Limerick, Ireland;Department of Computer Science and Information Systems, Unversity of Limerick, Limerick, Ireland
Venue:
Theoretical Computer Science
Year:
2004

Citing 5
Cited 4

How to draw a directed graph

Journal of Information Processing
Graph Drawing: Algorithms for the Visualization of Graphs

Graph Drawing: Algorithms for the Visualization of Graphs
Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization

GD '95 Proceedings of the Symposium on Graph Drawing
A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem

GD '97 Proceedings of the 5th International Symposium on Graph Drawing
A Fixed-Parameter Approach to Two-Layer Planarization

GD '01 Revised Papers from the 9th International Symposium on Graph Drawing

Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Cyclic level planarity testing and embedding

GD'07 Proceedings of the 15th international conference on Graph drawing
Practical level planarity testing and layout with embedding constraints

GD'07 Proceedings of the 15th international conference on Graph drawing
Exact Approaches to Multilevel Vertical Orderings

INFORMS Journal on Computing

Quantified Score

Hi-index	5.23

Visualization

Abstract

In this paper we consider the problems of testing a multi-level graph for planarity and laying out or, drawing, a multi-level graph in a clear way. We introduce a new abstraction of a common integer linear programming formulation of the problems that we call a vertex-exchange graph. We demonstrate how this concept can be used to solve the problems by providing clear and simple algorithms for testing a multi-level graph for planarity and laying out a multi-level graph when planar.