Faster Algorithms for Finding and Counting Subgraphs

Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman +2

In this paper we study a natural generalization of both {\sc $k$-Path} and {\sc $k$-Tree} problems, namely, the {\sc Subgraph Isomorphism} problem. In the {\sc Subgraph Isomorphism…