A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices
From MaRDI portal
Publication:4128621
DOI10.1145/321958.321963zbMath0357.05049MaRDI QIDQ4128621
Douglas C. Schmidt, Larry E. Druffel
Publication date: 1976
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321958.321963
05B20: Combinatorial aspects of matrices (incidence, Hadamard, etc.)
05C20: Directed graphs (digraphs), tournaments
68W99: Algorithms in computer science
05-04: Software, source code, etc. for problems pertaining to combinatorics
Related Items
Isomorphism identification of graphs: especially for the graphs of kinematic chains, A fast backtrack algorithm for graph isomorphism, Pattern associativity and the retrieval of semantic networks, Efficient graph automorphism by vertex partitioning, Algorithms for finding directed graph isomorphisms by finite automata