A Group-Theoretic Method for Drawing Graphs Symmetrically

  • David Abelson
  • Seok-Hee Hong
  • Donald E. Taylor
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2528)

Abstract

Constructing symmetric drawings of graphs is NP-hard.In this paper, we present a new method for drawing graphs symmetrically based on group theory.More formally, we define a n-geometric automorphism group of a graph that can be displayed as symmetries of a drawing of the graph in n dimensions.Then we present an algorithm to find all 2- and 3-geometric automorphism groups of a graph.We implement the algorithm using Magma [11] and the experimental results shows that our approach is very efficient in practice.W e also present a drawing algorithm to display a 2- or 3-geometric automorphism group.

References

  1. 1.
    D. Abelson, S. Hong and D.E. Taylor, A Group-Theoretic Method for Drawing Graphs Symmetrically, Technical Report IT-IVG-2002-01, School of Information Technologies, The University of Sydney, 2002.Google Scholar
  2. 2.
    C. Buchheim and M. J ünger, Detecting Symmetries by Branch and Cut, Graph Drawing 2001, Lecture Notes in Computer Science LNCS 2265, pp.178–188, Springer Verlag, 2002.CrossRefGoogle Scholar
  3. 3.
    P. Eades and X. Lin, Spring Algorithms and Symmetries, Theoretical Computer Science, 240, pp.379–405, 2000.MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    H. Fraysseix, An Heuristic for Graph Symmetry Detection, Graph Drawing’99, Lecture Notes in Computer Science 1731, pp.276–285, Springer Verlag, 1999.CrossRefGoogle Scholar
  5. 5.
    S. Hong, P. Eades and S. Lee, An Algorithm for Finding Geometric Automorphisms in Planar Graphs, Algorithms and Computation, Lecture Notes in Computer Science 1533, pp.277–286, Springer Verlag, 1998.CrossRefGoogle Scholar
  6. 6.
    S. Hong, Drawing Graphs Symmetrically in Three Dimensions, Graph Drawing 2001, Lecture Notes in Computer Science LNCS 2265, pp.189–204, Springer Verlag, 2002.CrossRefGoogle Scholar
  7. 7.
    S. Hong and P. Eades, Drawing Planar Graphs Symmetrically IV: Disconnected Graphs, Technical Report CS-IVG-2001-03, Basser Department of Computer Science, The University of Sydney, 2001.Google Scholar
  8. 8.
    J. Manning, Geometric Symmetry in Graphs, Ph.D. Thesis, Purdue Univ., 1990.Google Scholar
  9. 9.
  10. 10.
    W. Ledermann, Introduction to Group Theory, Longman, 1973.Google Scholar
  11. 11.
  12. 12.
  13. 13.
    Rome test suite ALF/CU, http://www.dia.uniroma3.it/~gdt.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • David Abelson
    • 1
  • Seok-Hee Hong
    • 2
  • Donald E. Taylor
    • 1
  1. 1.School of Mathematics and StatisticsUniversity of SydneyAustralia
  2. 2.School of Information TechnologiesUniversity of SydneyAustralia

Personalised recommendations