Finding a Maximum Common (Induced) Subgraph: Structural Parameters Revisited

Tesshu Hanaka, Yuto Okada, Yota Otachi +1

We study the parameterized complexity of the problems of finding a maximum common (induced) subgraph of two given graphs. Since these problems generalize several NP-complete proble…