The Vertex-Exchange Graph: A New Concept for Multi-level Crossing Minimisation

Healy, Patrick and Kuusik, Ago (1999) The Vertex-Exchange Graph: A New Concept for Multi-level Crossing Minimisation. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999 , pp. 205-216(Official URL: http://dx.doi.org/10.1007/3-540-46648-7_21).

Full text not available from this repository.

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.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-46648-7_21
Classifications: M Methods > M.999 Others
G Algorithms and Complexity > G.999 Others
M Methods > M.600 Planar
G Algorithms and Complexity > G.420 Crossings
G Algorithms and Complexity > G.770 Planarity Testing
P Styles > P.999 Others
P Styles > P.540 Planar
URI: http://gdea.informatik.uni-koeln.de/id/eprint/329

Actions (login required)

View Item View Item