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. We also present a drawing algorithm to display a 2- or 3-geometric automorphism group. © Springer-Verlag Berlin Heidelberg 2002.
Cite
CITATION STYLE
Abelson, D., Hong, S. H., & Taylor, D. E. (2002). A group-theoretic method for drawing graphs symmetrically. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2528 LNCS, pp. 86–97). Springer Verlag. https://doi.org/10.1007/3-540-36151-0_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
