A Backtrack Procedure for Isomorphism of Directed Graphs

DOI10.1145/321765.321766zbMath0304.68042OpenAlexW2086198191MaRDI QIDQ4060385

A. T. Berztiss

Publication date: 1973

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321765.321766

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Related Items (8)

A fast backtrack algorithm for graph isomorphism ⋮ Depth-first K-trees and critical path analysis ⋮ A search strategy for the elementary cycles of a directed graph ⋮ A new algorithm for digraph isomorphism ⋮ THE CHARACTERIZATION OF BINARY RELATION HOMOMORPHISMS ⋮ Further annotated bibliography on the isomorphism disease ⋮ Algorithms for finding directed graph isomorphisms by finite automata ⋮ Search for a unique incidence matrix of a graph

This page was built for publication: A Backtrack Procedure for Isomorphism of Directed Graphs