MultiRI: Fast Subgraph Matching in Labeled Multigraphs

The Subgraph Matching (SM) problem consists of finding all the embeddings of a given small graph, called the query, into a large graph, called the target. The SM problem has been widely studied for simple graphs, i.e. graphs where there is exactly one edge between two nodes and nodes have single labels, but few approaches have been devised for labeled multigraphs, i.e. graphs having possibly multiple labels on nodes in which pair of nodes may have multiple labeled edges between them. Here we present MultiRI, a novel algorithm for the Sub-Multigraph Matching (SMM) problem, i.e. subgraph matching in labeled multigraphs. MultiRI improves on the state-of-the-art by computing compatibility domains and symmetry breaking conditions on query nodes to filter the search space of possible solutions. Empirically, we show that MultiRI outperforms the state-of-the-art method for the SMM problem in both synthetic and real graphs, with a multiplicative speedup between five and ten for large graphs, by using a limited amount of memory.

[1]  Brendan D. McKay,et al.  Practical graph isomorphism, II , 2013, J. Symb. Comput..

[2]  Mario Vento,et al.  Thirty Years Of Graph Matching In Pattern Recognition , 2004, Int. J. Pattern Recognit. Artif. Intell..

[3]  Philip S. Yu,et al.  Subgraph Matching with Set Similarity in a Large Graph Database , 2015, IEEE Transactions on Knowledge and Data Engineering.

[4]  Xiang Lian,et al.  Quality-Aware Subgraph Matching Over Inconsistent Probabilistic Graph Databases , 2016, IEEE Transactions on Knowledge and Data Engineering.

[5]  Lei Zou,et al.  Answering Natural Language Questions by Subgraph Matching over Knowledge Graphs , 2018, IEEE Transactions on Knowledge and Data Engineering.

[6]  Vincenzo Bonnici,et al.  On the Variable Ordering in Subgraph Isomorphism Algorithms , 2017, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[7]  Vladimir Batagelj,et al.  Network analysis of dictionaries , 2002 .

[8]  Javier Larrosa,et al.  Constraint satisfaction algorithms for graph pattern matching , 2002, Mathematical Structures in Computer Science.

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

[10]  Spiros Papadimitriou,et al.  Fast Best-Effort Search on Graphs with Multiple Attributes , 2015, IEEE Transactions on Knowledge and Data Engineering.

[11]  Giovanni Micale,et al.  GASOLINE: a Greedy And Stochastic algorithm for Optimal Local multiple alignment of Interaction NEtworks , 2014, PloS one.

[12]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[13]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[14]  H. Mewes,et al.  The FunCat, a functional annotation scheme for systematic classification of proteins from whole genomes. , 2004, Nucleic acids research.

[15]  Mario Vento,et al.  A long trip in the charming world of graphs for Pattern Recognition , 2015, Pattern Recognit..

[16]  Rudolf Mathon,et al.  A Note on the Graph Isomorphism counting Problem , 1979, Inf. Process. Lett..

[17]  Dino Ienco,et al.  Mining frequent subgraphs in multigraphs , 2018, Inf. Sci..

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

[19]  Dennis Shasha,et al.  Fast analytical methods for finding significant labeled graph motifs , 2017, Data Mining and Knowledge Discovery.

[20]  Fernando M. A. Silva,et al.  Discovering Colored Network Motifs , 2014, CompleNet.

[21]  Ying Wang,et al.  Message-Passing Algorithms for Sparse Network Alignment , 2009, TKDD.

[22]  Giovanni Micale,et al.  Proteins comparison through probabilistic optimal structure local alignment , 2014, Front. Genet..

[23]  Kamel Madi,et al.  Inexact graph matching : application to 2D and 3D Pattern Recognition. (Appariement inexact de graphes : application à la reconnaissance de formes 2D et 3D) , 2016 .

[24]  Gary D. Bader,et al.  NetMatchStar : an enhanced Cytoscape network querying app , 2017 .

[25]  Julian R. Ullmann,et al.  Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism , 2010, JEAL.

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

[27]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[28]  Giovanni Micale,et al.  SPECTRA: An Integrated Knowledge Base for Comparing Tissue and Tumor-Specific PPI Networks in Human , 2015, Front. Bioeng. Biotechnol..

[29]  Giovanni Micale,et al.  GASOLINE: a Cytoscape app for multiple local alignment of PPI networks , 2014, F1000Research.

[30]  Mario Vento,et al.  Graph Matching and Learning in Pattern Recognition in the Last 10 Years , 2014, Int. J. Pattern Recognit. Artif. Intell..

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

[32]  Lakshmish Ramaswamy,et al.  DualIso: An Algorithm for Subgraph Pattern Matching on Very Large Labeled Graphs , 2014, 2014 IEEE International Congress on Big Data.

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

[34]  Dino Ienco,et al.  SuMGra: Querying Multigraphs via Efficient Indexing , 2016, DEXA.

[35]  Joshua A. Grochow,et al.  Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking , 2007, RECOMB.

[36]  Gunnar W. Klau,et al.  A new graph-based method for pairwise global network alignment , 2009, BMC Bioinformatics.

[37]  Alessia Saggese,et al.  Challenging the Time Complexity of Exact Subgraph Isomorphism for Huge and Dense Graphs with VF3 , 2018, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[38]  Peter J. Stuckey,et al.  Breaking Symmetries in Graph Representation , 2013, IJCAI.

[39]  Dennis Shasha,et al.  Fast methods for finding significant motifs on labelled multi-relational networks , 2019, J. Complex Networks.