Drawing Directed Graphs Using One-Dimensional Optimization

  • Liran Carmel
  • David Harel
  • Yehuda Koren
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2528)

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 .xed 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.

References

  1. 1.
    L. Carmel, D. Harel and Y. Koren, “Drawing Directed Graphs Using One-Dimensional Optimization”, Technical Report MCS02-14, TheWeizmann Institute of Science, 2001. Available on the web.Google Scholar
  2. 2.
    G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs, Prentice-Hall, 1999.Google Scholar
  3. 3.
    J. Diaz, J. Petit and M. Serna, “A Survey on Graph Layout Problems”, to appear in ACM Computing Surveys.Google Scholar
  4. 4.
    T. M. G. Fruchterman and E. Reingold, “Graph Drawing by Force-Directed Placement”, Software-Practice and Experience 21 (1991), 1129–1164.CrossRefGoogle Scholar
  5. 5.
    K. M. Hall, “An r-dimensional Quadratic Placement Algorithm”, Management Science 17 (1970), 219–229.MATHCrossRefGoogle Scholar
  6. 6.
    M. Kaufmann and D. Wagner (Eds.), Drawing Graphs: Methods and Models, Lecture Notes in Computer Science, Vol. 2025, Springer Verlag, 2001.MATHGoogle Scholar
  7. 7.
    Y. Koren, “On Spectral Graph Drawing”, manuscript, 2002.Google Scholar
  8. 8.
    Y. Koren, L. Carmel and D. Harel, “ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs”, Proc. IEEE Symp. on Information Visualization 2002 (InfoVis 2002), IEEE computer society press, to appear.Google Scholar
  9. 9.
    Y. Koren and D. Harel “A Multi-Scale Algorithm for the Linear Arrangement Problem”, Proc. Graph Theoretical Concepts in Computer Science 2002 (WG 2002), Springer-Verlag, to appear.Google Scholar
  10. 10.
    K. Sugiyama and K. Misue, “A Simple and Uni.ed Method for Drawing Graphs: Magnetic-Spring Algorithm”, Proc. Graph Drawing 1994, Lecture Notes in Computer Science, Vol. 894, pp. 364–375, Springer Verlag, 1995.Google Scholar
  11. 11.
    K. Sugiyama, S. Tagawa and M. Toda, “Methods for Visual Understanding of Hierarchical Systems”, IEEE Transactions on Systems, Man, and Cybernetics 11(2) (1981), 109–125.MathSciNetCrossRefGoogle Scholar
  12. 12.
    W. T. Tutte, “How to draw a graph”, Proc. London Math. Society 13 (1963), 743–768.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Liran Carmel
    • 1
  • David Harel
    • 1
  • Yehuda Koren
    • 1
  1. 1.Dept. of Computer Science and Applied MathematicsThe Weizmann Institute of ScienceRehovotIsrael

Personalised recommendations