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.

• Type: Conference
• Year: 2004
• Where: IWPEC
• Authors: Luke Mathieson, Elena Prieto, Peter Shaw
• Keywords: Crown Rule Reductions, Edge-disjoint Triangles, IWPEC 2004, Parameterized Complexity Viewpoint