Median graph: A new exact algorithm using a distance based on the maximum common subgraph

Median graphs have been presented as a useful tool for capturing the essential information of a set of graphs. Nevertheless, computation of optimal solutions is a very hard problem. In this work we present a new and more efficient optimal algorithm for the median graph computation. With the use of a particular cost function that permits the definition of the graph edit distance in terms of the maximum common subgraph, and a prediction function in the backtracking algorithm, we reduce the size of the search space, avoiding the evaluation of a great amount of states and still obtaining the exact median. We present a set of experiments comparing our new algorithm against the previous existing exact algorithm using synthetic data. In addition, we present the first application of the exact median graph computation to real data and we compare the results against an approximate algorithm based on genetic search. These experimental results show that our algorithm outperforms the previous existing exact algorithm and in addition show the potential applicability of the exact solutions to real problems.

[1]  E. K. WONG,et al.  Model matching in robot vision by subgraph isomorphism , 1992, Pattern Recognit..

[2]  Horst Bunke,et al.  Graph Clustering Using the Weighted Minimum Common Supergraph , 2003, GbRPR.

[3]  King-Sun Fu,et al.  A distance measure between attributed relational graphs for pattern recognition , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[4]  Abraham Kandel,et al.  Mean and maximum common subgraph of two graphs , 2000, Pattern Recognit. Lett..

[5]  Walter F. Bischof,et al.  Rulegraphs for graph matching in pattern recognition , 1994, Pattern Recognit..

[6]  Abraham Kandel,et al.  On the Minimum Common Supergraph of Two Graphs , 2000, Computing.

[7]  Horst Bunke,et al.  A Comparison of Algorithms for Maximum Common Subgraph on Randomly Connected Graphs , 2002, SSPR/SPR.

[8]  Kaspar Riesen,et al.  Fast Suboptimal Algorithms for the Computation of Graph Edit Distance , 2006, SSPR/SPR.

[9]  Yu Wang,et al.  A novel efficient algorithm for determining maximum common subgraphs , 2005, Ninth International Conference on Information Visualisation (IV'05).

[10]  Egon Balas,et al.  Finding a Maximum Clique in an Arbitrary Graph , 1986, SIAM J. Comput..

[11]  Richard C. Wilson,et al.  Mixing spectral representations of graphs , 2006, 18th International Conference on Pattern Recognition (ICPR'06).

[12]  Horst Bunke,et al.  On a relation between graph edit distance and maximum common subgraph , 1997, Pattern Recognit. Lett..

[13]  Alberto Sanfeliu,et al.  Synthesis of Median Spectral Graph , 2005, IbPRIA.

[14]  Mario Vento,et al.  Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs , 2007, J. Graph Algorithms Appl..

[15]  Horst Bunke,et al.  Combinatorial search versus genetic algorithms: A case study based on the generalized median graph problem , 1999, Pattern Recognit. Lett..

[16]  Alfred O. Hero,et al.  A binary linear programming formulation of the graph edit distance , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[17]  Horst Bunke,et al.  On Median Graphs: Properties, Algorithms, and Applications , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[18]  Shengrui Wang,et al.  Median graph computation for graph clustering , 2006, Soft Comput..

[19]  Dit-Yan Yeung,et al.  Structural, Syntactic, and Statistical Pattern Recognition: Joint IAPR International Workshops, SSPR 2006 and SPR 2006, Hong Kong, China, August 17-19, ... (Lecture Notes in Computer Science) , 2006 .

[20]  Dit-Yan Yeung,et al.  Structural, Syntactic, and Statistical Pattern Recognition, Joint IAPR International Workshops, SSPR 2006 and SPR 2006, Hong Kong, China, August 17-19, 2006, Proceedings , 2006, SSPR/SPR.

[21]  Horst Bunke,et al.  Inexact graph matching for structural pattern recognition , 1983, Pattern Recognit. Lett..

[22]  Ernest Valveny,et al.  On the Relation Between the Median and the Maximum Common Subgraph of a Set of Graphs , 2007, GbRPR.

[23]  A. Paone,et al.  Discrete Time Relaxation Based on Direct Quadrature Methods for Volterra Integral Equations , 1999, Computing.

[24]  Ching Y. Suen,et al.  Hierarchical attributed graph representation and recognition of handwritten chinese characters , 1991, Pattern Recognit..

[25]  J. J. McGregor,et al.  Backtrack search algorithms and the maximal common subgraph problem , 1982, Softw. Pract. Exp..

[26]  Ernest Valveny,et al.  Bounding the Size of the Median Graph , 2007, IbPRIA.