Combinatorial models and algorithms in chemistry. Search for isomorphisms and automorphisms of molecular graphs
- 1 June 1988
- journal article
- Published by Wiley in Journal of Computational Chemistry
- Vol. 9 (4) , 303-314
- https://doi.org/10.1002/jcc.540090405
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Unique description of chemical structures based on hierarchically ordered extended connectivities (HOC procedures). I. Algorithms for finding graph orbits and canonical numbering of atomsJournal of Computational Chemistry, 1985
- Computer hardware and software in chemical information processingJournal of Chemical Information and Computer Sciences, 1985
- A non-factorial algorithm for canonical numbering of a graphJournal of Algorithms, 1984
- A technique for determining the symmetry properties of molecular graphsJournal of Computational Chemistry, 1983
- Further annotated bibliography on the isomorphism diseaseJournal of Graph Theory, 1979
- Computing automorphisms and canonical labellings of graphsLecture Notes in Mathematics, 1978
- The graph isomorphism diseaseJournal of Graph Theory, 1977
- On Canonical Numbering of Atoms in a Molecule and Graph IsomorphismJournal of Chemical Information and Computer Sciences, 1977
- Canonical Numbering and Constitutional SymmetryJournal of Chemical Information and Computer Sciences, 1977
- The Generation of a Unique Machine Description for Chemical Structures-A Technique Developed at Chemical Abstracts Service.Journal of Chemical Documentation, 1965