An Heuristic for Graph Symmetry Detection

De Fraysseix, Hubert (1999) An Heuristic for Graph Symmetry Detection. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999 , pp. 276-285(Official URL: http://dx.doi.org/10.1007/3-540-46648-7_29).

Full text not available from this repository.

Abstract

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 the embedded graph. It has been particularly developed to detect axial symmetries.

Item Type: Conference Paper
Classifications: G Algorithms and Complexity > G.910 Symmetries
G Algorithms and Complexity > G.999 Others
URI: http://gdea.informatik.uni-koeln.de/id/eprint/356

Actions (login required)

View Item View Item