How to Layer a Directed Acyclic Graph

  • Patrick Healy
  • Nikola S. Nikolov
Conference paper

DOI: 10.1007/3-540-45848-4_2

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2265)
Cite this paper as:
Healy P., Nikolov N.S. (2002) How to Layer a Directed Acyclic Graph. In: Mutzel P., Jünger M., Leipert S. (eds) Graph Drawing. GD 2001. Lecture Notes in Computer Science, vol 2265. Springer, Berlin, Heidelberg

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.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Patrick Healy
    • 1
  • Nikola S. Nikolov
    • 1
  1. 1.CSIS DepartmentUniversity of LimerickLimerickRepublic of Ireland

Personalised recommendations