Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask)

Dániel Marx, Michal Pilipczuk, Marc Herbstritt
2014 Symposium on Theoretical Aspects of Computer Science  
Given two graphs H and G, the Subgraph Isomorphism problem asks if H is isomorphic to a subgraph of G. While NP-hard in general, algorithms exist for various parameterized versions of the problem. However, the literature contains very little guidance on which combinations of parameters can or cannot be exploited algorithmically. Our goal is to systematically investigate the possible parameterized algorithms that can exist for Subgraph Isomorphism. We develop a framework involving 10 relevant
more » ... ameters for each of H and G (such as treewidth, pathwidth, genus, maximum degree, number of vertices, number of components, etc.), and ask if an algorithm with running time f 1 (p 1 , p 2 , . . . , p ) · n f2(p +1 ,...,p k ) exists, where each of p 1 , . . . , p k is one of the 10 parameters depending only on H or G. We show that all the questions arising in this framework are answered by a set of 11 maximal positive results (algorithms) and a set of 17 maximal negative results (hardness proofs); some of these results already appear in the literature, while others are new in this paper. On the algorithmic side, our study reveals for example that an unexpected combination of bounded degree, genus, and feedback vertex set number of G gives rise to a highly nontrivial algorithm for Subgraph Isomorphism. On the hardness side, we present W[1]-hardness proofs under extremely restricted conditions, such as when H is a bounded-degree tree of constant pathwidth and G is a planar graph of bounded pathwidth.
doi:10.4230/lipics.stacs.2014.542 dblp:conf/stacs/MarxP14 fatcat:dy4trfjwkvhj3i2tzcvrguedyi