Sciweavers

Share
IWPEC
2004
Springer

Packing Edge Disjoint Triangles: A Parameterized View

9 years 7 months ago
Packing Edge Disjoint Triangles: A Parameterized View
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 applications in many areas, especially computational biology [BP96]. In this paper we present an analysis of the problem from a parameterized complexity viewpoint. We describe a fixed-parameter tractable algorithm for the problem by means of kernelization and crown rule reductions, two of the newest techniques for fixed-parameter algorithm design. We achieve a kernel size bounded by 4k, where k is the number of triangles in the packing.
Luke Mathieson, Elena Prieto, Peter Shaw
Added 02 Jul 2010
Updated 02 Jul 2010
Type Conference
Year 2004
Where IWPEC
Authors Luke Mathieson, Elena Prieto, Peter Shaw
Comments (0)
books