An Efficient Algorithm for Graph Isomorphism
Journal of the ACM (JACM)
A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
An Algorithm for Finding Three Dimensional Symmetry in Series Parallel Digraphs
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
On Maximum Symmetric Subgraphs
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
An Algorithm for Finding Three Dimensional Symmetry in Trees
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
A Group-Theoretic Method for Drawing Graphs Symmetrically
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
| Hi-index | 0.00 |
We give a short introduction to an heuristic to find automorphisms in a graph such as axial, central or rotational symmetries. Using techniques of factorial analysis, we embed the graph in an Euclidean space and try to detect and interpret the geometric symmetries of of the embedded graph. It has been particularly developed to detect axial symmetries.