A General backtrack algorithm for the isomorphism problem of combinatorial objects
- 31 December 1985
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 1 (4) , 363-381
- https://doi.org/10.1016/s0747-7171(85)80021-3
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Computing automorphism groups of error-correcting codesIEEE Transactions on Information Theory, 1982
- Group-Theoretic Algorithms and Graph IsomorphismLecture Notes in Computer Science, 1982
- A Theoretical Analysis of Various Heuristics for the Graph Isomorphism ProblemSIAM Journal on Computing, 1980
- On an algorithm for finding a base and a strong generating set for a group given by generating permutationsMathematics of Computation, 1980
- An algorithm for computing the automorphism group of a Hadamard matrixJournal of Combinatorial Theory, Series A, 1979
- Hadamard equivalence via graph isomorphismDiscrete Mathematics, 1979
- The graph isomorphism diseaseJournal of Graph Theory, 1977
- Linear time algorithm for isomorphism of planar graphs (Preliminary Report)Published by Association for Computing Machinery (ACM) ,1974
- Enumeration of latin squares with application to order 8Journal of Combinatorial Theory, 1968