Abstract
In this paper we consider the problems of testing a multi-level graph for planarity and laying out a multi-level graph. We introduce a new abstraction that we call a vertex-exchange graph. We demonstrate how this concept can be used to solve these problems by providing clear and simple algorithms for testing a multi-level graph for planarity and laying out a multi-level graph when planar. We also show how the concept can be used to solve other problems relating to multi-level graph layout.
Cite
CITATION STYLE
Healy, P., & Kuusik, A. (1999). The vertex-exchange graph: A new concept for multi-level crossing minimisation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1731, pp. 205–216). Springer Verlag. https://doi.org/10.1007/3-540-46648-7_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
