Drawing directed graphs using one-dimensional optimization

Liran Carmel*, David Harel, Yehuda Koren

*Corresponding author for this work

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

11 Scopus citations


We present an algorithm for drawing directed graphs, which is based on rapidly solving a unique one-dimensional optimization problem for each of the axes. The algorithm results in a clear description of the hierarchy structure of the graph. Nodes are not restricted to lie on fixed horizontal layers, resulting in layouts that convey the symmetries of the graph very naturally. The algorithm can be applied without change to cyclic or acyclic digraphs, and even to graphs containing both directed and undirected edges. We also derive a hierarchy index from the input digraph, which quantitatively measures its amount of hierarchy.

Original languageAmerican English
Title of host publicationGraph Drawing - 10th International Symposium, GD 2002, Revised Papers
EditorsMichael T. Goodrich, Stephen G. Kobourov
PublisherSpringer Verlag
Number of pages14
ISBN (Print)3540001581, 9783540001584
StatePublished - 2002
Externally publishedYes
Event10th International Symposium on Graph Drawing, GD 2002 - Irvine, CA, United States
Duration: 26 Aug 200228 Aug 2002

Publication series

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


Conference10th International Symposium on Graph Drawing, GD 2002
Country/TerritoryUnited States
CityIrvine, CA


Dive into the research topics of 'Drawing directed graphs using one-dimensional optimization'. Together they form a unique fingerprint.

Cite this