This Article 
 Bibliographic References 
 Add to: 
Combining Hierarchy and Energy Drawing Directed Graphs
January-February 2004 (vol. 10 no. 1)
pp. 46-57

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.

[1] U. Brandes, G. Shubina, R. Tamassia, and D. Wagner, Fast Layout Methods for Timetable Graphs Proc. Graph Drawing (GD '00), pp. 127-138, 2000.
[2] R. Davidson and D. Harel, Drawing Graphs Nicely Using Simulated Annealing ACM Trans. Graphics, vol. 15, pp. 301-331, 1996.
[3] G. Di Battista, P. Eades, R. Tamassia, and I.G. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, 1999.
[4] J. Diaz, J. Petit, and M. Serna, A Survey on Graph Layout Problems ACM Computing Surveys, vol. 34, pp. 313-356, 2002.
[5] P. Eades, A Heuristic for Graph Drawing Congressus Numerantium, vol. 42, pp. 149-160, 1984.
[6] T.M.G. Fruchterman and E. Reingold, Graph Drawing by Force-Directed Placement Software-Practice and Experience, vol. 21, pp. 1129-1164, 1991.
[7] E. Gansner, E. Koutsofios, and S. North, Drawing Graphs withdot, AT&T Labs-Research, , 2002.
[8] G.H. Golub and C.F. Van Loan, Matrix Computations. Baltimore: Johns Hopkins Univ. Press, 1996.
[9] K.M. Hall, Anr-Dimensional Quadratic Placement Algorithm Management Science, vol. 17, pp. 219-229, 1970.
[10] M. Jünger and P. Mutzel, Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization Proc. Graph Drawing (GD '95), pp. 337-348, 1995.
[11] T. Kamada and S. Kawai, An Algorithm for Drawing General Undirected Graphs Information Processing Letters, vol. 31, pp. 7-15, 1989.
[12] T. Kamps, J. Kleinz, and J. Read, Constraint-Based Spring-Model Algorithm for Graph Layout Proc. Graph Drawing (GD '95), pp. 349-360, 1995.
[13] Drawing Graphs: Methods and Models, M. Kaufmann and D. Wagner, eds. Springer Verlag, 2001.
[14] Y. Koren, On Spectral Graph Drawing Proc. Int'l Computing and Combinatorics Conf. (COCOON '03), pp. 496-508, 2003.
[15] Y. Koren and D. Harel, Axis-by-Axis Stress Minimization Proc. Graph Drawing (GD '03), 2003.
[16] Y. Koren, L. Carmel, and D. Harel, ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs Proc. IEEE Symp. Information Visualization 2002 (InfoVis 2002), pp. 137-144, 2002.
[17] Y. Koren, L. Carmel, and D. Harel, Drawing Huge Graphs by Algebraic Multigrid Optimization Multiscale Modeling and Simulation, SIAM, to appear.
[18] Y. Koren and D. Harel, A Multi-Scale Algorithm for the Linear Arrangement Problem Proc. Graph Theoretical Concepts in Computer Science 2002 (WG '02), pp. 293-306, 2002.
[19] R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon, Network Motifs: Simple Building Blocks of Complex Networks Science, vol. 298, pp. 824-827, 2002.
[20] K. Sugiyama and K. Misue, A Simple and Unified Method for Drawing Graphs: Magnetic-Spring Algorithm Proc. Graph Drawing (GD '94), pp. 364-375, 1995.
[21] K. Sugiyama, S. Tagawa, and M. Toda, Methods for Visual Understanding of Hierarchical Systems IEEE Trans. Systems, Man, and Cybernetics, vol. 11, pp. 109-125, 1981.
[22] W.T. Tutte, How to Draw a Graph Proc. London Math. Soc., vol. 13, pp. 743-768, 1963.
[23] The Matrix Market collection,math.nist.govMatrixMarket, 2003.

Index Terms:
Directed graph drawing, force directed layout, hierarchy energy, Fiedler vector, minimum linear arrangement.
Liran Carmel, David Harel, Yehuda Koren, "Combining Hierarchy and Energy Drawing Directed Graphs," IEEE Transactions on Visualization and Computer Graphics, vol. 10, no. 1, pp. 46-57, Jan.-Feb. 2004, doi:10.1109/TVCG.2004.1260757
Usage of this product signifies your acceptance of the Terms of Use.