Combining hierarchy and energy for drawing directed graphs

Liran Carmel*, David Harel, Yehuda Koren

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

31 Scopus citations

Abstract

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
Pages (from-to)46-57
Number of pages12
JournalIEEE Transactions on Visualization and Computer Graphics
Volume10
Issue number1
DOIs
StatePublished - Jan 2004
Externally publishedYes

Keywords

  • Directed graph drawing
  • Fiedler vector
  • Force directed layout
  • Hierarchy energy
  • Minimum linear arrangement

Fingerprint

Dive into the research topics of 'Combining hierarchy and energy for drawing directed graphs'. Together they form a unique fingerprint.

Cite this