A Backtrack Procedure for Isomorphism of Directed Graphs

Authors:
A. T. Berztiss
Affiliations:
University of Pittsburgh, Department of Computer Science, Pittsburgh, PA
Venue:
Journal of the ACM (JACM)
Year:
1973

Citing 7
Cited 6

A Flow Analysis Algorithm

Journal of the ACM (JACM)
Backtrack Programming

Journal of the ACM (JACM)
Nondeterministic Algorithms

Journal of the ACM (JACM)
An Efficient Algorithm for Graph Isomorphism

Journal of the ACM (JACM)
A man-machine approach toward solving the traveling salesman problem

Communications of the ACM
GIT—a heuristic program for testing pairs of directed line graphs for isomorphism

Communications of the ACM
Data Structures: Theory and Practice

Data Structures: Theory and Practice

An Algorithm for Subgraph Isomorphism

Journal of the ACM (JACM)
A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices

Journal of the ACM (JACM)
Edge-labeled directed graphs in APL

APL '75 Proceedings of seventh international conference on APL
Constraint satisfaction algorithms for graph pattern matching

Mathematical Structures in Computer Science
A Graph Model for Fault-Tolerant Computing Systems

IEEE Transactions on Computers
Structural Preserving Morphisms of Finite Automata and an Application to Graph Isomorphism

IEEE Transactions on Computers

Quantified Score

Hi-index	0.01

Visualization

Abstract

A reasonably efficient procedure for testing pairs of directed graphs for isomorphism is important in information retrieval and other application fields in which structured data have to be matched. One such procedure, a backtrack procedure based on a representation of directed graphs by linear formulas, is described. A procedure for finding a partial subdigraph of a digraph that is isomorphic to a given digraph is also described.