Isomorphism, Automorphism Partitioning, and Canonical Labeling Can Be Solved in Polynomial-Time for Molecular Graphs
- 28 March 1998
- journal article
- research article
- Published by American Chemical Society (ACS) in Journal of Chemical Information and Computer Sciences
- Vol. 38 (3) , 432-444
- https://doi.org/10.1021/ci9702914
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Determination of Topological Equivalence Classes of Atoms and Bonds in C20−C60 Fullerenes Using a New Prolog Coding ProgramJournal of Chemical Information and Computer Sciences, 1996
- A Linear-Time Algorithm for Isomorphism of Graphs of Bounded Average GenusSIAM Journal on Discrete Mathematics, 1994
- Polynomial algorithms for graph isomorphism and chromatic index on partial k-treesJournal of Algorithms, 1990
- Extended connectivity in chemical graphsTheoretical Chemistry Accounts, 1982
- Group-Theoretic Algorithms and Graph IsomorphismLecture Notes in Computer Science, 1982
- An Approach to the Assignment of Canonical Connection Tables and Topological Symmetry PerceptionJournal of Chemical Information and Computer Sciences, 1979
- Erroneous Claims Concerning the Perception of Topological SymmetryJournal of Chemical Information and Computer Sciences, 1978
- Computer Perception of Topological SymmetryJournal of Chemical Information and Computer Sciences, 1977
- On the Structure of Polynomial Time ReducibilityJournal of the ACM, 1975
- The Generation of a Unique Machine Description for Chemical Structures-A Technique Developed at Chemical Abstracts Service.Journal of Chemical Documentation, 1965