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

Authors:
Stephen H. Unger
Affiliations:
Columbia Univ., New York
Venue:
Communications of the ACM
Year:
1964

Citing 1
Cited 13

COMIT

Communications of the ACM

Unification theory

Journal of Symbolic Computation
A Mechanical Analysis of the Cyclic Structure of Undirected Linear Graphs

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

Journal of the ACM (JACM)
A Backtrack Procedure for Isomorphism of Directed Graphs

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

Journal of the ACM (JACM)
Synthesizing constraint expressions

Communications of the ACM
Algorithms for finding a fundamental set of cycles for an undirected linear graph

Communications of the ACM
Automated display techniques for linear graphs

SIGGRAPH '77 Proceedings of the 4th annual conference on Computer graphics and interactive techniques
Numerical applications: Cycle algorithms for undirected linear graphs and some immediate applications

ACM '65 Proceedings of the 1965 20th national conference
A short survey on the state of the art in matching and unification problems

ACM SIGSAM Bulletin
Structural Preserving Morphisms of Finite Automata and an Application to Graph Isomorphism

IEEE Transactions on Computers
Efficient graph automorphism by vertex partitioning

Artificial Intelligence
A hough transform technique for subgraph isomorphism

Pattern Recognition Letters

Quantified Score

Hi-index	48.25

Visualization

Abstract

Given a pair of directed line graphs, the problem of ascertaining whether or not they are isomorphic is one for which no efficient algorithmic solution is known. Since a straightforward enumerative algorithm might require 40 years of running time on a very high speed computer in order to compare two 15-node graphs, a more sophisticated approach seems called for. The situation is similar to that prevailing in areas such as game-playing and theorem-proving, where practical algorithms are unknown (for the interesting cases), but where various practical though only partially successful techniques are available. GIT—Graph Isomorphism Tester—incorporates a variety of processes that attempt to narrow down the search for an isomorphism, or to demonstrate that none exists. No one scheme is relied upon exclusively for a solution, and the program is designed to avoid excessive computation along fruitless lines. GIT has been written in the COMIT language and successfully tested on the IBM 7090.