The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants

The Glasgow Subgraph Solver provides an implementation of state of the art algorithms for subgraph isomorphism problems. It combines constraint programming concepts with a variety of strong but fast domain-specific search and inference techniques, and is suitable for use on a wide range of graphs, including many that are found to be computationally hard by other solvers. It can also be equipped with side constraints, and can easily be adapted to solve other subgraph matching problem variants. We outline its key features from the view of both users and algorithm developers, and discuss future directions.

[1]  Gilles Audemard,et al.  Scoring-Based Neighborhood Dominance for the Subgraph Isomorphism Problem , 2014, CP.

[2]  Lakhdar Sais,et al.  Nogood Recording from Restarts , 2007, IJCAI.

[3]  Dennis Shasha,et al.  A subgraph isomorphism algorithm and its application to biochemical data , 2013, BMC Bioinformatics.

[4]  Mario Vento,et al.  A (sub)graph isomorphism algorithm for matching large graphs , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Ciaran McCreesh,et al.  Sequential and Parallel Solution-Biased Search for Subgraph Algorithms , 2019, CPAIOR.

[6]  Noga Alon,et al.  Biomolecular network motif counting and discovery by color coding , 2008, ISMB.

[7]  Christine Solnon,et al.  AllDifferent-based filtering for subgraph isomorphism , 2010, Artif. Intell..

[8]  Ciaran McCreesh,et al.  A Parallel, Backjumping Subgraph Isomorphism Algorithm Using Supplemental Graphs , 2015, CP.

[9]  C. Sims.  Computational methods in the study of permutation groups , 1970 .

[10]  Jirí Fiala,et al.  Locally constrained graph homomorphisms - structure, complexity, and applications , 2008, Comput. Sci. Rev..

[11]  Ciaran McCreesh,et al.  Justifying All Differences Using Pseudo-Boolean Reasoning , 2020, AAAI.

[12]  Lorna M. Lopez,et al.  Modulation of Genetic Associations with Serum Urate Levels by Body-Mass-Index in Humans , 2015, PloS one.

[13]  Heiko Dörr,et al.  Efficient Graph Rewriting and Its Implementation , 1995, Lecture Notes in Computer Science.

[14]  Christine Solnon,et al.  When Subgraph Isomorphism is Really Hard, and Why This Matters for Graph Databases , 2018, J. Artif. Intell. Res..

[15]  Yves Deville,et al.  Solving subgraph isomorphism problems with constraint programming , 2009, Constraints.

[16]  Muffy Calder,et al.  Conditional Bigraphs , 2020, ICGT.

[17]  Christine Solnon,et al.  On the subgraph epimorphism problem , 2014, Discret. Appl. Math..

[18]  Christof Vömel,et al.  The Secret Life of Keys: On the Calculation of Mechanical Lock Systems , 2017, SIAM Rev..

[19]  Jimmy Ho-Man Lee,et al.  Increasing Nogoods in Restart-Based Search , 2016, AAAI.

[20]  Muffy Calder,et al.  Bigraphs with sharing , 2015, Theor. Comput. Sci..

[21]  Alessia Saggese,et al.  Introducing VF3: A New Algorithm for Subgraph Isomorphism , 2017, GbRPR.

[22]  Elio Marchione,et al.  Event Networks and the Identification of Crime Pattern Motifs , 2015, PloS one.

[23]  Christine Solnon,et al.  Portfolios of Subgraph Isomorphism Algorithms , 2016, LION.

[24]  Christine Solnon,et al.  Experimental Evaluation of Subgraph Isomorphism Solvers , 2019, GbRPR.

[25]  Christina Boucher,et al.  Counting motifs in dynamic networks , 2018, BMC Systems Biology.

[26]  Jean-Charles Régin,et al.  A Filtering Algorithm for Constraints of Difference in CSPs , 1994, AAAI.

[27]  Padraig Cunningham,et al.  Temporal subgraph isomorphism , 2013, 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013).

[28]  Ciaran McCreesh,et al.  Between Subgraph Isomorphism and Maximum Common Subgraph , 2017, AAAI.

[29]  Mats Carlsson,et al.  Modeling Universal Instruction Selection , 2015, CP.