Isomorphism, automorphism partitioning, and canonical labeling Can Be solved in polynomial-time for molecular graphs

Journal of Chemical Information and Computer Sciences

Volumn 38, Issue 3, 1998, Pages 432-444

  Faulon, Jean Loup ^a  

^a SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002690545     PISSN: 00952338     EISSN: None     Source Type: Journal    
DOI: 10.1021/ci9702914     Document Type: Article

References (34)

1. Read, R. C.; Corneil, D. G. The Graph Isomorphism Disease. J. Graph. Theory 1977, 1, 339-363.
2. Miller, G. Graph isomorphism, general remarks. J. Comput. Syst. Sci. 1979, 18, 128-142.
3. Babai, L.; Kucera, L. Canonical labelling of graphs in linear average time. In Foundations of Computer Science, Proceedings of the 20th IEEE Symposium, 1979; pp 39-46.
4. Morgan, H. L. Generation of a unique machine description for chemical structures - A technique developed at chemical abstracts services. J. Chem. Doc. 1965, 5, 107-113.
5. Carhart, R. E. Erroneous claims concerning the perception of topological symmetry. J. Chem. Inf. Comput. Sci. 1978, 18, 108-110.
6. Rücker, G.; Rücker, C. Computer perception of constitutional (topological) symmetry: TOPSYM, A fast algorithm for partitioning atoms and pairwise relations among atoms into equivalent classes. J. Chem. Inf. Comput. Sci. 1990, 30, 187-191.
7. Rücker, G.; Rücker, C. On using the adjacency matrix power method for perception of symmetry and for isomorphism testing of highly intricate graphs. J. Chem. Inf. Comput. Sci. 1991, 31, 123-126.
8. Babai, L.; Erdös, P.; Selkow, S. M. Random graph isomorphism. SIAM J. Computing 1980, 9, 628-635.
9. Köbler, J.; Schöning, U.; Torán, J. The Graph Isomorphism Problem. Its Structural Complexity; Birkhauser: Boston, 1993.
10. Liu, X.; Klein, D. J. The graph isomorphism problem. J. Comput. Chem. 1991, 12, 1243-1251.
11. Collatz. L.; Sinogowitz, U. Spektren endlichen Graphen. Abh. Math. Sem. Univ. Hamburg 1957, 21, 63-77.
12. Fan, B. T.; Barbu, A.; Panaye, A.; Doucet, J.-P. Detection of constitutionally equivalent sites from a connection table. J. Chem. Inf. Comput. Sci. 1996, 36, 654-659.
13. Broadbelt, L. J.; Stark, S. M.; Klein, M. T. Computer generated reaction modelling: decomposition and encoding algorithms for determining species uniqueness. Comput. Chem. Eng. 1995, 20, 113-129.
14. Hopcroft, J. E.; Tarjan, R. E. Isomorphism of planar graphs. In Complexity of Computer Computation; Miller, R. E., Thatcher, J. W. Ed.; Plenum: New York, 1972; pp 131-152.
15. Ladner, R. E. On the structure of polynomial-time reducibilities. J. Assoc. Comput. Mach. 1975, 22, 155-171.
16. Hopcroft, J. E.; Wong, J. K. Linear time algorithm for isomorphism of planar graphs. Proc. 6th ACM Symp. Theory Comput. 1974, 172-184.
17. Bodlaender, H. L. Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees. J. Algorithms 1990, 11, 631-643.
18. Luks, E. M. Isomorphism of graphs of bounded valence can be tested in polynomial time. J. Comput. Sys. Sci. 1982, 25, 42-65.
19. Hoffmann, C. M. Group-Theoretic Algorithms and Graph Isomorphism; Springer-Verlag: Berlin, 1982.
20. Babai, L.; Luks, E. M. Canonical labelling of graphs. Proc. 15th ACM Symp. Theory Comp. 1983, 171-183.
21. Chen, J. A linear-time algorithm for isomorphism of graphs of bounded average genus. SIAM J. Disc. Math. 1994, 7, 614-631.
22. Kucera, L. Combinatorial Algorithms; Adam Hilger: Bristol, 1989.
23. Hopcroft, J. E.; Tarjan, R. E. Efficient planarity testing. J. Assoc. Comput. Mach. 1974, 22, 155-171.
24. Razinger, M. Extended connectivity in chemical graphs. Theor. Chim. Acta 1982, 61, 581-586.
25. Shelley, C. A.; Munk, M. E. Computer perception of topological symmetry. J. Chem. Inf. Comput. Sci. 1977, 17, 110-113.
26. Shelley, C. A.; Munk, M. E. An approach to the assignment of canonical tables and topological symmetry perception. J. Chem. Inf. Comput. Sci. 1979, 19, 247-250.
27. Wipke, W. T.; Dyott, T. M. Stereochemically unique naming algorithm. J. Am. Chem. Soc. 1974, 96, 4834-4842.
28. Moreau, G. A. Topological code for molecular structures. A modified Morgan algorithm. Nouv. J. Chim. 1980, 4, 17-22.
29. Balaban, A. T.; Mekenyan, O. Bonchev, D. Unique description of chemical structures based on hierarchically ordered extended connectivities (HOC procedures). I. Algorithms for finding graph orbits and canonical numbering of atoms. J. Comput. Chem. 1985, 6, 538-551.
30. Lui, X.; Balasubramanian, K.; Munk, M. E. Computational techniques for vertex partitioning of graphs. J. Chem. Inf. Comput. Sci. 1990, 30, 187-191.
31. Laidboeur, T.; Cabrol-Bass, D.; Ivanciuc, O. Determination of topological equivalent classes of atoms and bonds in C20-C60 fullerenes using a new prolog coding program. J. Chem. Inf. Comput. Sci. 1996, 36, 811-821.
32. k).
33. Whitney, H. A set of topological invaraints for graphs. Am. J. Math. 1933, 55, 321-325.
34. Auslander, L.; Parter, S. V. On embedding graphs into the plane. J. Math. Mech. 1961, 10, 517-523.