A New Algorithm for Graph Monomorphism Based on the Projections of the Product Graph

A new algorithm is presented for detecting graph monomorphisms for a pair of graphs. This algorithm entails a tree search based on the projections of the product graph called the net of the two graphs. It uses the minimum number of neighbors of the projected graphs to detect infeasible subtrees. The algorithm, in comparison with that of Deo and coworkers, is more efficient in its storage space utilization and average execution time. It does not suffer from the ambiguity which arises in Deo et al.'s work when cyclic graphs are matched. Applications to attributed graph monomorphisms are included.

[1]  Harry G. Barrow,et al.  SOME TECHNIQUES FOR RECOGNISING STRUCTURES IN PICTURES , 1972 .

[2]  Derek G. Corneil,et al.  The graph isomorphism disease , 1977, J. Graph Theory.

[3]  George I. Davida,et al.  Optimum Featurs and Graph Isomorphism , 1974, IEEE Trans. Syst. Man Cybern..

[4]  Julian R. Ullmann,et al.  An Algorithm for Subgraph Isomorphism , 1976, J. ACM.

[5]  Stephen H. Unger,et al.  GIT—a heuristic program for testing pairs of directed line graphs for isomorphism , 1964, CACM.

[6]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[7]  Andrew K. C. Wong,et al.  Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[8]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[9]  King-Sun Fu,et al.  Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis , 1979, IEEE Transactions on Systems, Man, and Cybernetics.

[10]  James Turner,et al.  Generalized Matrix Functions and the Graph Isomorphism Problem , 1968 .

[11]  Andrew K. C. Wong,et al.  Graph Optimal Monomorphism Algorithms , 1980, IEEE Transactions on Systems, Man, and Cybernetics.

[12]  Kabekode V. S. Bhat,et al.  Refined Vertex Codes and Vertex Partitioning Methodology for Graph Isomorphism Testing , 1980, IEEE Transactions on Systems, Man, and Cybernetics.

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  Alfs T. Berztiss,et al.  A Backtrack Procedure for Isomorphism of Directed Graphs , 1973, JACM.

[15]  Kellogg S. Booth,et al.  Isomorphism Testing for Graphs, Semigroups, and Finite Automata Are Polynomially Equivalent Problems , 1978, SIAM J. Comput..

[16]  Thomas S. Huang,et al.  A subgraph isomorphism algorithm using resolution , 1981, Pattern Recognit..

[17]  D. Corneil,et al.  An Efficient Algorithm for Graph Isomorphism , 1970, JACM.

[18]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[19]  Edward H. Sussenguth.  A Graph-Theoretic Algorithm for Matching Chemical Structures. , 1965 .

[20]  Robert E. Tarjan,et al.  Isomorphism of Planar Graphs , 1972, Complexity of Computer Computations.

[21]  Douglas C. Schmidt,et al.  A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices , 1976, J. ACM.

[22]  Narsingh Deo,et al.  A new algorithm for digraph isomorphism , 1977 .

[23]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.