A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

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

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

doi:10.4230/lipics.stacs.2014.542
dblp:conf/stacs/MarxP14
fatcat:dy4trfjwkvhj3i2tzcvrguedyi