Algorithms for finding directed graph isomorphisms by finite automata
DOI10.1007/BF00982292zbMath0428.68072MaRDI QIDQ3865499
Charmane P. May, Chaochih Yang
Publication date: 1980
Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)
worst-case complexityMoore machinegraph isomorphism problemdeterministic state machinefinding directed graph isomorphisms by finite automatanondeterministic state machine
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Cites Work
- Unnamed Item
- Graph isomorphism: A heuristic edge-partitioning-oriented algorithm
- The Determinant of the Adjacency Matrix of a Graph
- A Backtrack Procedure for Isomorphism of Directed Graphs
- Optimum Featurs and Graph Isomorphism
- Structural Preserving Morphisms of Finite Automata and an Application to Graph Isomorphism
- An Algorithm for Subgraph Isomorphism
- A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices
- A new algorithm for digraph isomorphism
- A Correction and Some Comments Concerning Graph Isomorphism by Finite Automata
- Search for a unique incidence matrix of a graph
- Generation of All Closed Partitions on the State Set of a Sequential Machine
- Generalized Matrix Functions and the Graph Isomorphism Problem
- An Efficient Algorithm for Graph Isomorphism
- On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
- GIT—a heuristic program for testing pairs of directed line graphs for isomorphism
This page was built for publication: Algorithms for finding directed graph isomorphisms by finite automata
