An Efficient Algorithm for Graph Isomorphism

  title={An Efficient Algorithm for Graph Isomorphism},
  author={Derek G. Corneil and Calvin C. Gotlieb},
  journal={J. ACM},
A procedure for determining whether two graphs are isomorphic is described. During the procedure, from any given graph two graphs, the representative graph and the reordered graph, are derived. The representative graph is a homomorphic image of the original graph; the reordered graph is constructed from the representative graph to be isomorphic to the given graph. Unique labels are assigned to the vertices of both derived graphs. It follows that two repre- sentative graphs or two reordered… 

Figures from this paper

On graph isomorphism and graph automorphism

The problem of graph isomorphism, graph automorphism and a unique graph ID is considered. A new approach to the solution of these problems is suggested. The method is based on the spectral

Subgraph Isomorphism in Polynomial

A new approach to the problem of subgraph isomorphism detection for systems which diierentiate between graphs that are a priori known and unknown, and unknown graphs, and a computational complexity analysis of the new method is given.

Graph Invariants and Graph Isomorphism

In graph theory, Graph Isomorphism is an important issue. Information in the database can be stored in the form of graph. Graph represents the structural information in an efficient way. Graph

Subgraph Isomorphism in Polynomial Time

Several pruning techniques which aim at reducing the size of the decision tree are presented, which are based on an intensive preprocessing step in which the model graphs are used to create a decision tree.

A graph isomorphism algorithm for object recognition

The algorithm works for all types of graphs except for a class of highly ambiguous graphs which includes strongly regular graphs, which leaves the option of switching to a higher complexity algorithm if desired.

The Graph Pattern Matching Problem through Parameterized Matching

The empirical measurements show that graph linearization finds a matching graph faster than VF2 in many cases, especially in Miyazaki-constructed graphs which are known to be one of the hardest cases for graph isomorphism algorithms.

A Database of Graphs for Isomorphism and Sub-Graph Isomorphism Benchmarking

A database containing 72,800 couples of graphs especially devised for comparing the performance of isomorphic and graph-subgraph isomorphism algorithms is described.

Conceptual Graphs Isomorphism: Algorithm and Use

A conceptual graph set managing system based on the specialization relation and on a hashing function on the code induced by a structural C-preordering function that allows an effective search for a given conceptual graph according to its structure and so determines its specialization / generalization graphs without any projection test.

Suboptimal Graph Isomorphism using bipartite Matching

A novel approach for the efficient computation of graph isomorphism is presented, based on bipartite graph matching by means of an assignment algorithm, and it is shown that the proposed algorithm rejects only very few pairs of graphs and otherwise returns correct results.

Graph Isomorphism Algorithm by Perfect Matching

This paper determined graph isomorphism with the help of perfect matching algorithm, to limit the range of search of 1 to 1 correspondences between the two graphs to information in the table, and obtained a complextity of O(n 4).



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

The algorithm presented in this paper finds a spanning tree and then constructs the set of fundamental cycles and is slower than an algorithm presented by Welch by a ratio of N/3 (N is the number of nodes) but requires less storage.

Strongly regular graphs, partial geometries and partially balanced designs.

This paper introduces the concept of a partial geometry, which serves to unify and generalize certain theorems on embedding of nets, and uniqueness of association schemes of partially balanced

Orthogonal Matrices with Zero Diagonal

The central problem in the present paper is the construction of symmetric and of skew-symmetric ( = skew) matrices C of order v, with diagonal elements 0 and other elements + 1 or — 1, satisfying The

Storage and retrieval of information on chemical structures by computer.

A method for the linear recording of graphs

A Graph-Theoretic Algorithm for Matching Chemical Structures.

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

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.