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. © Springer-Verlag 2004.
|Title of host publication||Parameterized and Exact Computation|
|Subtitle of host publication||First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004. Proceedings|
|Editors||Rod Downey, Michael Fellows, Frank Dehne|
|Number of pages||11|
|Publication status||Published - 2004|
|Name||Lecture Notes in Computer Science|