A Comparison of Decomposition Methods for the Maximum Common Subgraph Problem

The maximum common subgraph problem is an NP-hard problem which is very difficult to solve with exact approaches. To speed up the solution process, we may decompose it into independent subproblems which are solved in parallel. We describe a new decomposition method which exploits the structure of the problem to decompose it. We compare this structural decomposition with domain-based decompositions, which basically split variable domains. Experimental results show us that the structural decomposition leads to better speedups on two classes of instances, and to worse speedups on one class of instances.

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

[2]  Eugene C. Freuder,et al.  Contradicting Conventional Wisdom in Constraint Satisfaction , 1994, ECAI.

[3]  Rina Dechter,et al.  Tree Clustering for Constraint Networks , 1989, Artif. Intell..

[4]  Philippe Jégou.  Decomposition of Domains Based on the Micro-Structure of Finite Constraint-Satisfaction Problems , 1993, AAAI.

[5]  Jean-Charles Régin,et al.  Embarrassingly Parallel Search , 2013, CP.

[6]  Christian Bessiere,et al.  Specific Filtering Algorithms for Over-Constrained Problems , 2001, CP.

[7]  Philippe Jégou,et al.  On a generalization of triangulated graphs for domains decomposition of CSPs , 2003, IJCAI.

[8]  J. Christopher Beck.  Principles and Practice of Constraint Programming , 2017, Lecture Notes in Computer Science.

[9]  Christine Solnon,et al.  CP Models for Maximum Common Subgraph Problems , 2011, CP.

[10]  Dusanka Janezic,et al.  Exact Parallel Maximum Clique Algorithm for General and Protein Graphs , 2013, J. Chem. Inf. Model..

[11]  Christine Solnon,et al.  A study of ACO capabilities for solving the maximum clique problem , 2006, J. Heuristics.

[12]  Ciaran McCreesh,et al.  The Shape of the Search Tree for the Maximum Clique Problem and the Implications for Parallel Branch and Bound , 2014, ACM Trans. Parallel Comput..

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

[14]  Ciaran McCreesh,et al.  Multi-Threading a State-of-the-Art Maximum Clique Algorithm , 2013, Algorithms.

[15]  Peter Willett,et al.  RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs , 2002, Comput. J..

[16]  Jean-Charles Régin,et al.  Improvement of the Embarrassingly Parallel Search for Data Centers , 2014, CP.

[17]  Uue Kjjrull.  Triangulation of Graphs { Algorithms Giving Small Total State Space Triangulation of Graphs { Algorithms Giving Small Total State Space , 1990 .

[18]  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..