@inproceedings{3d81611bd5914d5bace86ac8a5de289d,
title = "How to layer a directed acyclic graph",
abstract = "We consider the problem of partitioning a directed acyclic graph into layers such that all edges point unidirectionally. We perform an experimental analysis of some of the existing layering algorithms and then propose a new algorithm that is more realistic in the sense that it is possible to incorporate specific information about node and edge widths into the algorithm. The goal is to minimize the total sum of edge spans subject to dimension constraints on the drawing. We also present some preliminary results from experiments we have conducted using our layering algorithm on over 5900 example directed acyclic graphs.",
author = "Patrick Healy and Nikolov, {Nikola S.}",
year = "2002",
doi = "10.1007/3-540-45848-4_2",
language = "English",
isbn = "3540433090",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "16--30",
editor = "Petra Mutzel and Michael Junger and Sebastian Leipert",
booktitle = "Graph Drawing - 9th International Symposium, GD 2001, Revised Papers",
note = "9th International Symposium on Graph Drawing, GD 2001 ; Conference date: 23-09-2001 Through 26-09-2001",
}