License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.05191.6
URN: urn:nbn:de:0030-drops-3430
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2006/343/
Go to the corresponding Portal

Harrigan, Martin ; Healy, Patrick

On Layering Directed Acyclic Graphs

pdf-format:
05191.HarriganMartin.Paper.343.pdf (0.2 MB)

Abstract

We consider the problem of layering a directed acyclic graph with minimum dummy nodes. We present a new Integer Linear Programming (ILP) formulation of the problem based on a set of fundamental cycles in the underlying undirected graph and show that it can be solved in polynomial time. We outline some of the advantages of the formulation. Each solution defines a family of layerings with the same number of dummy nodes. We can also transform one solution into another by adding or removing certain combinations of dummy nodes, thus allowing the consideration of other aesthetics.

BibTeX - Entry

@InProceedings{harrigan_et_al:DagSemProc.05191.6,
  author =	{Harrigan, Martin and Healy, Patrick},
  title =	{{On Layering Directed Acyclic Graphs}},
  booktitle =	{Graph Drawing},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{5191},
  editor =	{Michael J\"{u}nger and Stephen Kobourov and Petra Mutzel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2006/343},
  URN =		{urn:nbn:de:0030-drops-3430},
  doi =		{10.4230/DagSemProc.05191.6},
  annote =	{Keywords: Graph Drawing, Hierarchical Drawings, Layerings, Minimum Dummy Nodes}
}

Keywords: Graph Drawing, Hierarchical Drawings, Layerings, Minimum Dummy Nodes
Collection: 05191 - Graph Drawing
Issue Date: 2006
Date of publication: 09.01.2006

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI