Subgraph isomorphism for biconnected outerplanar graphs in cubic time
Theoretical Computer Science
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth
Journal of Computer and System Sciences
On Parameterized Path and Chordless Path Problems
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
Obtaining a planar graph by vertex deletion
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Fast FPT-Algorithms for cleaning grids
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Random separation: a new method for solving fixed-cardinality optimization problems
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Parameterized Complexity
| Hi-index | 0.00 |
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.