A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; 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)
[article]

2013
*
arXiv
*
pre-print

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: for example, the problem can be solved (1) in time 2^O(|V(H)|)· n^O((H)) using the color-coding technique of Alon, Yuster, and Zwick; (2) in time f(|V(H)|,(G))· n using Courcelle's Theorem; (3) in time f(|V(H)|,(G))· n using a result on first-order model checking by Frick and Grohe; or (4) in time

arXiv:1307.2187v3
fatcat:jbzjhag5d5cgdj6sed7q5hv4om