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.
This research has been supported by a grant from the Australian Research Council. Full version of this paper is available from http://www.cs.usyd.edu.au/~shhong/publication.htm [1].
Chapter PDF
References
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.
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.
P. Eades and X. Lin, Spring Algorithms and Symmetries, Theoretical Computer Science, 240, pp.379–405, 2000.
H. Fraysseix, An Heuristic for Graph Symmetry Detection, Graph Drawing’99, Lecture Notes in Computer Science 1731, pp.276–285, Springer Verlag, 1999.
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.
S. Hong, Drawing Graphs Symmetrically in Three Dimensions, Graph Drawing 2001, Lecture Notes in Computer Science LNCS 2265, pp.189–204, Springer Verlag, 2002.
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.
J. Manning, Geometric Symmetry in Graphs, Ph.D. Thesis, Purdue Univ., 1990.
Groups & Graphs, http://130.179.24.217/G&G/G&G.html.
W. Ledermann, Introduction to Group Theory, Longman, 1973.
Magma, http://magma.maths.usyd.edu.au.
nauty, http://cs.anu.edu.au/~bdm/nauty.
Rome test suite ALF/CU, http://www.dia.uniroma3.it/~gdt.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abelson, D., Hong, SH., Taylor, D.E. (2002). A Group-Theoretic Method for Drawing Graphs Symmetrically. In: Goodrich, M.T., Kobourov, S.G. (eds) Graph Drawing. GD 2002. Lecture Notes in Computer Science, vol 2528. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36151-0_9
Download citation
DOI: https://doi.org/10.1007/3-540-36151-0_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00158-4
Online ISBN: 978-3-540-36151-0
eBook Packages: Springer Book Archive