A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
In the Maximum Common Induced Subgraph problem (henceforth MCIS), given two graphs G_1 and G_2, one looks for a graph with the maximum number of vertices being both an induced subgraph of G_1 and G_2. MCIS is among the most studied classical NP-hard problems. It remains NP-hard on many graph classes including forests. In this paper, we study the parameterized complexity of MCIS. As a generalization of Clique, it is W-hard parameterized by the size of the solution. Being NP-hard even onarXiv:1412.1261v2 fatcat:ownbquhznvcrnmz4uthnys5o3m