Parameterized Graph Cleaning Problems
We investigate the Induced Subgraph Isomorphism problem with non-standard parametrization, where the parameter is the difference |V(G)| − |V(H)| with H and G being the smaller and the larger input graph, respectively. Intuitively, we can interpret this problem as “cleaning” the graph G, regarded as a pattern containing extra vertices indicating errors, in order to obtain the graph H representing the original pattern. We show fixed-parameter tractability of the cases where both H and G are planar and H is 3-connected, or H is a tree and G is arbitrary.
Unable to display preview. Download preview PDF.
- 4.Chen, Y., Flum, J.: On parameterized path and chordless path problems. In: 22nd Annual IEEE Conference on Computational Complexity, pp. 250–263 (2007)Google Scholar