The vertex-exchange graph: A new concept for multi-level crossing minimisation

Patrick Healy, Ago Kuusik

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationGraph Drawing - 7th International Symposium, GD 1999, Proceedings
EditorsJan Kratochvil
PublisherSpringer Verlag
Pages205-216
Number of pages12
ISBN (Print)3540669043, 9783540669043
DOIs
Publication statusPublished - 1999
Event7th International Symposium on Graph Drawing, GD 1999 - Prague, Czech Republic
Duration: 15 Sep 199919 Sep 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1731
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference7th International Symposium on Graph Drawing, GD 1999
Country/TerritoryCzech Republic
CityPrague
Period15/09/9919/09/99

Fingerprint

Dive into the research topics of 'The vertex-exchange graph: A new concept for multi-level crossing minimisation'. Together they form a unique fingerprint.

Cite this