A Backtrack Procedure for Isomorphism of Directed Graphs

DOI10.1145/321765.321766zbMATH Open0304.68042OpenAlexW2086198191MaRDI QIDQ4060385FDOQ4060385

Authors: 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

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

Cited In (8)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4060385)