A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf
.
Packing Edge Disjoint Triangles: A Parameterized View
[chapter]
2004
Lecture Notes in Computer Science
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
doi:10.1007/978-3-540-28639-4_12
fatcat:vp5fnhk725eg7lfe6q2j35srtq