Survey of Graph Matching Algorithms

Graph matching problems of varying types are important in a wide array of application areas. A graph matching problem is a problem involving some form of comparison between graphs. Some of the many application areas of such problems include information retrieval, sub-circuit identification, chemical structure classification, and networks. Problems of efficient graph matching arise in any field that may be modeled with graphs. For example, any problem that can be modeled with binary relations between entities in the domain is such a problem. The individual entities in the problem domain become nodes in the graph. And each binary relation becomes an edge between the appropriate nodes. Although it is possible to formulate such a large array of problems as graph matching problems, it is not necessarily a good idea to do so. Graph matching is a very difficult problem. The graph isomorphism problem is to determine if there exists a one-to-one mapping from the nodes of one graph to the nodes of a second graph that preserves adjacency. Similarly, the subgraph isomorphism problem is to determine if there exists a one-to-one mapping from the

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

[2]  Eugene M. Luks.  Isomorphism of Graphs of Bounded Valence Can Be Tested in Polynomial Time , 1980, FOCS.

[3]  James A. Hendler,et al.  The Case for Graph-Structured Representations , 1997, ICCBR.

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

[5]  Frank Harary,et al.  Graph Theory , 2016 .

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

[7]  Horst Bunke,et al.  A Network Based Approach to Exact and Inexact Graph Matching , 1993 .

[8]  Salih O. Duffuaa,et al.  A Linear Programming Approach for the Weighted Graph Matching Problem , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[9]  László Babai,et al.  Moderately Exponential Bound for Graph Isomorphism , 1981, FCT.

[10]  James A. Hendler,et al.  Massively parallel matching of knowledge structures , 1994 .

[11]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[12]  Chao-Chih Yang,et al.  Structural Preserving Morphisms of Finite Automata and an Application to Graph Isomorphism , 1975, IEEE Trans. Computers.

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

[14]  Daniel A. Spielman,et al.  Faster isomorphism testing of strongly regular graphs , 1996, STOC '96.

[15]  Gary L. Miller,et al.  Isomorphism of k-Contractible Graphs. A Generalization of Bounded Valence and Bounded Genus , 1983, Inf. Control..

[16]  Gary L. Miller.  Isomorphism of Graphs Which are Pairwise k-separable , 1983, Inf. Control..

[17]  Horst Bunke,et al.  Subgraph Isomorphism in Polynomial Time , 1995 .

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

[19]  Bernard Kolman,et al.  Introductory Linear Algebra with Applications , 1976 .

[20]  P. Messmer.  Fast Error-correcting Graph Isomorphism Based on Model , 1996 .

[21]  Andrew K. C. Wong,et al.  An algorithm for graph optimal monomorphism , 1990, IEEE Trans. Syst. Man Cybern..

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

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

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

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

[26]  William C. Regli,et al.  Resolving non-uniqueness in design feature histories , 1999, SMA '99.

[27]  F. Harary.  The Determinant of the Adjacency Matrix of a Graph , 1962 .

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

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

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