84 search results - page 2 / 17 » Linear Problem Kernels for NP-Hard Problems on Planar Graphs |
AAIM
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We present new kernelization results for the s-cycle transversal problem for s > 3. In particular, we show a 6k2 kernel for 4-cycle transversal and a O(ks−1 ) kernel...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We study a general class of problems called F -Deletion problems. In an F -Deletion problem, we are asked whether a subset of at most k vertices can be deleted from a graph G such...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
CORR
1999
Springer
13 years 4 months ago
1999
Springer
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
ALGORITHMICA
2000
13 years 4 months ago
2000
