DROPS

Document

On Layering Directed Acyclic Graphs

Authors: Martin Harrigan and Patrick Healy

Published in: Dagstuhl Seminar Proceedings, Volume 5191, Graph Drawing (2006)

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.

Cite as

Martin Harrigan and Patrick Healy. On Layering Directed Acyclic Graphs. In Graph Drawing. Dagstuhl Seminar Proceedings, Volume 5191, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@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/entities/document/10.4230/DagSemProc.05191.6},
  URN =		{urn:nbn:de:0030-drops-3430},
  doi =		{10.4230/DagSemProc.05191.6},
  annote =	{Keywords: Graph Drawing, Hierarchical Drawings, Layerings, Minimum Dummy Nodes}
}

Search Results

Documents authored by Harrigan, Martin

On Layering Directed Acyclic Graphs

Abstract

Cite as

Thanks for your feedback!

Could not send message