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 application/pdf
.
On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism
[chapter]
2015
Lecture Notes in Computer Science
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[1]-hard parameterized by the size of the solution. Being NP-hard even on
doi:10.1007/978-3-319-19315-1_1
fatcat:knzdi3nve5ao7kvxr7ubulpdnq