Parameterized Complexity of Finding a Maximum Common Vertex Subgraph Without Isolated Vertices

Palash Dey, Anubhav Dhar, Ashlesha Hota +2

In this paper, we study the Maximum Common Vertex Subgraph problem: Given two input graphs $G_1,G_2$ and a non-negative integer $h$, is there a common subgraph $H$ on at least $h$…