A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices
- 1 July 1976
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 23 (3) , 433-445
- https://doi.org/10.1145/321958.321963
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- A Backtrack Procedure for Isomorphism of Directed GraphsJournal of the ACM, 1973
- An Efficient Algorithm for Graph IsomorphismJournal of the ACM, 1970
- An Appraisal of Some Shortest-Path AlgorithmsOperations Research, 1969
- Generalized Matrix Functions and the Graph Isomorphism ProblemSIAM Journal on Applied Mathematics, 1968
- Point-symmetric graphs with a prime number of pointsJournal of Combinatorial Theory, 1967
- A Graph-Theoretic Algorithm for Matching Chemical Structures.Journal of Chemical Documentation, 1965
- GIT—a heuristic program for testing pairs of directed line graphs for isomorphismCommunications of the ACM, 1964
- Strongly regular graphs, partial geometries and partially balanced designsPacific Journal of Mathematics, 1963
- The Determinant of the Adjacency Matrix of a GraphSIAM Review, 1962
- Algorithm 97: Shortest pathCommunications of the ACM, 1962