A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices

DOI10.1145/321958.321963zbMath0357.05049OpenAlexW2095052098MaRDI QIDQ4128621

Larry E. Druffel, Douglas C. Schmidt

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

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Directed graphs (digraphs), tournaments (05C20) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items

Parallel Algorithm for Solving the Graph Isomorphism Problem, A fast backtrack algorithm for graph isomorphism, A long trip in the charming world of graphs for pattern recognition, Filtering graphs to check isomorphism and extracting mapping by using the conductance electrical model, A matching algorithm between precursory 3D process model and 2D working procedure drawing based on subgraph isomorphism, Parallel algorithms for flexible pattern matching on big graphs, Unnamed Item, Isomorphism testing via polynomial-time graph extensions, Lorentzian spectral geometry with causal sets, Isomorphism identification of graphs: especially for the graphs of kinematic chains, Pattern associativity and the retrieval of semantic networks, Algorithms for finding directed graph isomorphisms by finite automata, A parametric filtering algorithm for the graph isomorphism problem, SPECTRUM BASED TECHNIQUES FOR GRAPH ISOMORPHISM, Efficient graph automorphism by vertex partitioning