TY - JOUR
T1 - Combining hierarchy and energy for drawing directed graphs
AU - Carmel, Liran
AU - Harel, David
AU - Koren, Yehuda
PY - 2004/1
Y1 - 2004/1
N2 - 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.
AB - 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.
KW - Directed graph drawing
KW - Fiedler vector
KW - Force directed layout
KW - Hierarchy energy
KW - Minimum linear arrangement
UR - http://www.scopus.com/inward/record.url?scp=4243182673&partnerID=8YFLogxK
U2 - 10.1109/TVCG.2004.1260757
DO - 10.1109/TVCG.2004.1260757
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
C2 - 15382697
AN - SCOPUS:4243182673
SN - 1077-2626
VL - 10
SP - 46
EP - 57
JO - IEEE Transactions on Visualization and Computer Graphics
JF - IEEE Transactions on Visualization and Computer Graphics
IS - 1
ER -