Efficient graph automorphism by vertex partitioning
- 31 March 1983
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 21 (1-2) , 245-269
- https://doi.org/10.1016/s0004-3702(83)80012-5
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- A subgraph isomorphism algorithm using resolutionPattern Recognition, 1981
- Increasing tree search efficiency for constraint satisfaction problemsArtificial Intelligence, 1980
- The Consistent Labeling Problem: Part IIPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980
- Graph Optimal Monomorphism AlgorithmsIEEE Transactions on Systems, Man, and Cybernetics, 1980
- Refined Vertex Codes and Vertex Partitioning Methodology for Graph Isomorphism TestingIEEE Transactions on Systems, Man, and Cybernetics, 1980
- Further annotated bibliography on the isomorphism diseaseJournal of Graph Theory, 1979
- The Consistent Labeling Problem: Part IIEEE Transactions on Pattern Analysis and Machine Intelligence, 1979
- Backtrack programming techniquesCommunications of the ACM, 1975
- On the Computational Complexity of Combinatorial ProblemsNetworks, 1975
- An Efficient Algorithm for Graph IsomorphismJournal of the ACM, 1970