An heuristic for graph symmetry detection

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1731, Issue , 1999, Pages 276-285

  De Fraysseix, Hubert ^a  

^a ÉCOLE DES HAUTES ÉTUDES EN SCIENCES SOCIALES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

AXIAL SYMMETRY; EMBEDDED GRAPHS; EUCLIDEAN SPACES; FACTORIAL ANALYSIS; GEOMETRIC SYMMETRY; MORPHISMS; ROTATIONAL SYMMETRIES; SYMMETRY DETECTION;

DRAWING (GRAPHICS);

EID: 84958966224     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46648-7_29     Document Type: Conference Paper

References (20)

1. J.P. Benzécri and et al, L'analyse des données—Tome II: l'analyse des corre-spondances, Dunod, Paris, 1973.
2. M. Capobianco, Examples and counterexamples in graph theory, Elsevier, North Holland, New-York, 1978.
3. C.N.R.S. (ed.), L'analyse factorielle et ses applications, Paris, 1956.
4. D.G. Corneil and C.C. Gotlieb, An efficient algorithm for graph isomorphism, Journal of the ACM 17 (1970), no. 1, 51-64.
5. H. de Fraysseix and P. Ossona de Mendez, Discovering automorphisms using abstract distances, Tech. report, KAM-DIMATIA Series, 1999, (in preparation).
6. H. de Fraysseix and Kuntz P., Pagination of large scale networks, Algorithms review 2 (1992), no. 3, 105-112.
7. I.S. Filotti and J.N. Mayer, A polynomial-time algorithm for determining the iso-morphism of graphs of fixed genus (working paper), Conference Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing (Los Angele, California), 1980, pp. 236-243.
8. S.L. Hakimi and S.S. Yau, Distance matrix of a graph and its realizability, Quaterly of Applied Mathematics 22 (1964), 305-317.
9. S-H. Hong, P. Eades, and S-H. Lee, Finding planar geometric automorphisms in planar graphs, ISAAC 98 (ed. Chwa and Ibarra), Springer Lecture Notes in Computer Science 1533 (1998), 277-286.
10. [10] S-H. Hong, P. Eades, and S-H. Lee, Drawing series parallel digraphs symmetrically (to appear).
11. [11] J.E. Hopcroft and J.K. Wong, Linear time algorithm for isomorphism of planar graphs (preliminary report), Conference Record of Sixth Annual ACM Symposium on Theory of Computing (Seattle, Washington), 1974, pp. 172-184.
12. [12] J.B. Kruskal and J.B. Seery, Designing network diagrams, Proceedings of the First General Conference on Social Graphics, 1978, pp. 22-50.
13. [13] P. Kuntz, Repr_esentation euclidienne d'un graphe en vue de sa segmentation, Ph.D. thesis, Ecole des Hautes Etudes en Sciences Sociales, Paris, 1992.
14. [14] G.S. Lueker and S.B. Kellogg, A linear time algorithm for deciding interval graph isomorphism, Journal of the ACM 26(1979), no. 2, 183-195.
15. [15] J. Manning, Geometric symmetry in graphs, Ph.D. thesis, Purdue University, New York, 1990.
16. [16] J. Manning and M.J. Atallah, Fast detection and display of symmetry in trees, Congressus Numerantium 64(1988), 159-169.
17. [17], Fast detection and display of symmetry in outerplanar graphs, Discrete Applied Mathematics 39(1992), 13-35.
18. [18] G.L. Miller, Isomorphism testing for graphs of bounded genus, Conference Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing (Los Angeles, California), 1980, pp. 225-235.
19. [19], Isomorphism of graphs which are pairwise k-separable, Information and Control 56(1983), no. 1/2, 21-33.
20. Isomorphism of -contractible graphs. a generalization of bounded valence and bounded genus, Information and Control 56 (1983), no. 1/2, 1-20.