An experimental comparison of force-directed and randomized graph drawing algorithms

  • Franz J. Brandenburg
  • Michael Himsolt
  • Christoph Rohrer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1027)

Abstract

We report on our experiments with five graph drawing algorithms for general undirected graphs. These are the algorithms FR introduced by Fruchterman and Reingold [5], KK by Kamada and Kawai [11], DH by Davidson and Harel [1], Tu by Tunkelang [13] and GEM by Frick, Ludwig and Mehldau [6]. Implementations of these algorithms have been integrated into our GraphEd system [9]. We have tested these algorithms on a wide collection of examples and with different settings of parameters. Our examples are from original papers and by our own. The obtained drawings are evaluated both empirically and by GraphEd's evaluation toolkit. As a conclusion we can confirm the reported good behaviour of the algorithms. Combining time and quality we recommend to use GEM or KK first, then FR and Tu and finally DH.

References

  1. [1]
    Davidson, R., Harel, D.: Drawing graphs nicely using simulated annealing. Department of Applied Mathematics and Computer Science (1991)Google Scholar
  2. [2]
    Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Algorithms for drawing graphs: an annotated bibliography. Comput. Geom. Theory Appl. 4 (1991) 235–282Google Scholar
  3. [3]
    Di Battista, G., Garg, A., Liotta, G., Tassinari, E., Tamassia, R., Vargiu, F.: An experimental comparison of three graph drawing algorithms. Proc. 11th AMC Sympos. Comput. Geom. (1995)Google Scholar
  4. [4]
    Eades, P.: A heuristic for graph drawing. Congressus Numeratium 42 (1984) 149–160Google Scholar
  5. [5]
    Fruchtermann, T.M.J., Reingold, E.M.: Graph drawing by force-directed placement. Software, Practice and Experience 21 (1991) 1129–1164Google Scholar
  6. [6]
    Frick, A., Ludwig, A., Mehldau, H.: A fast adaptive layout algorithm for undirected graphs. Proc. Workshop on Graph Drawing 94. LNCS 894 (1994) 389–403Google Scholar
  7. [7]
    Harel, D., Sardas, M.: Randomized graph drawing with heavy-duty preprocessing. Department of Applied Mathematics and Computer Science Weizmann Institute of Science, Rehovot/Israel, Technical Report CS93-16 (1993)Google Scholar
  8. [8]
    Himsolt, M.: Konzeption und Implementierung von Grapheneditoren. Dissertation, Universität Passau, Shaker Verlag Aachen (1993)Google Scholar
  9. [9]
    Himsolt, M.: GraphEd: A graphical platform for the implementation of graph algorithms. Proc. Workshop on Graph Drawing 94, LNCS 894 (1994) 182–193Google Scholar
  10. [10]
    Himsolt, M.: Comparing and evaluating layout algorithms within GraphEd. J. Visual Languages and Computing 6 (1995)Google Scholar
  11. [11]
    Kamada, T., Kawai, S.: An algorithm for drawing general undirected graphs. Inf. Proc. Letters 31 (1989) 7–15CrossRefGoogle Scholar
  12. [12]
    Rohrer, C.: Layout von Graphen unter besonderer Berücksichtigung von probabilistischen Algorithmen. Diplomarbeit, Universität Passau (1995)Google Scholar
  13. [13]
    Tunkelang, D.: A practical approach to drawing undirected graphs. Carnegie Mellon University (1994)Google Scholar

Copyright information

© Springer-Verlag 1996

Authors and Affiliations

  • Franz J. Brandenburg
    • 1
  • Michael Himsolt
    • 1
  • Christoph Rohrer
    • 1
  1. 1.University of PassauPassauGermany

Personalised recommendations