176 search results - page 1 / 36 » A Problem Kernelization for Graph Packing |
SOFSEM
2009
Springer
14 years 1 months ago
2009
Springer
SODA
2012
ACM
11 years 9 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several c...
ESA
2004
Springer
14 years 7 days ago
2004
Springer
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...
IWPEC
2004
Springer
14 years 6 days ago
2004
Springer
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...