Geometric symmetry in graphs
Spring algorithms and symmetry
Theoretical Computer Science - computing and combinatorics
Finding Planar Geometric Automorphisms in Planar Graphs
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
An Heuristic for Graph Symmetry Detection
GD '99 Proceedings of the 7th International Symposium on Graph Drawing
Drawing Graphs Symmetrically in Three Dimensions
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Detecting Symmetries by Branch & Cut
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Linkless symmetric drawings of series parallel digraphs
Computational Geometry: Theory and Applications
Geometric automorphism groups of graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |
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.