Efficient Implementation of Color Coding Algorithm for Subgraph Isomorphism Problem

08/29/2019
by   Josef Malík, et al.
0

We consider the subgraph isomorphism problem where, given two graphs G (source graph) and F (pattern graph), one is to decide whether there is a (not necessarily induced) subgraph of G isomorphic to F. While many practical heuristic algorithms have been developed for the problem, as pointed out by McCreesh et al. [JAIR 2018], for each of them there are rather small instances which they cannot cope. Therefore, developing an alternative approach that could possibly cope with these hard instances would be of interest. A seminal paper by Alon, Yuster and Zwick [J. ACM 1995] introduced the color coding approach to solve the problem, where the main part is a dynamic programming over color subsets and partial mappings. As with many exponential-time dynamic programming algorithms, the memory requirements constitute the main limiting factor for its usage. Because these requirements grow exponentially with the treewidth of the pattern graph, all existing implementations based on the color coding principle restrict themselves to specific pattern graphs, e.g., paths or trees. In contrast, we provide an efficient implementation of the algorithm significantly reducing its memory requirements so that it can be used for pattern graphs of larger treewidth. Moreover, our implementation not only decides the existence of an isomorphic subgraph, but it also enumerates all such subgraphs (or given number of them). We provide an extensive experimental comparison of our implementation to other available solvers for the problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/11/2021

Current Algorithms for Detecting Subgraphs of Bounded Treewidth are Probably Optimal

The Subgraph Isomorphism problem is of considerable importance in comput...
research
04/17/2020

Hitting forbidden induced subgraphs on bounded treewidth graphs

For a fixed graph H, the H-IS-Deletion problem asks, given a graph G, fo...
research
05/05/2018

On exploiting degeneracy to count subgraphs

Motivated by practical applications, we study the complexity of counting...
research
09/04/2015

NoSPaM Manual - A Tool for Node-Specific Triad Pattern Mining

The detection of triadic subgraph motifs is a common methodology in comp...
research
03/11/2019

A GraphBLAS Approach for Subgraph Counting

Subgraph counting aims to count the occurrences of a subgraph template T...
research
05/03/2019

Positive-Instance Driven Dynamic Programming for Graph Searching

Research on the similarity of a graph to being a tree - called the treew...
research
06/04/2019

Motivo: fast motif counting via succinct color coding and adaptive sampling

The randomized technique of color coding is behind state-of-the-art algo...

Please sign up or login with your details

Forgot password? Click here to reset