A parameterized perspective on packing paths of length two

AbstractWe study (vertex-disjoint) packings of paths of length two (i.e., of P2’s) in graphs under a parameterized perspective. Starting from a maximal P2-packing ℘ of size j we use extremal combinatorial arguments for determining how many vertices of ℘ appear in some P2-packing of size (j+1) (if such a packing exists). We prove that one can ‘reuse’ 2.5j vertices. We also show that this bound is asymptotically sharp. Based on a WIN-WIN approach, we build an algorithm which decides, given a graph, if a P2-packing of size at least k exists in time $\mathcal{O}^{*}(2.448^{3k})$ .

[1]  Ge Xia,et al.  Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size , 2005, SIAM J. Comput..

[2]  Pawel Zylinski,et al.  Packing Three-Vertex Paths in a Subcubic Graph , 2005 .

[3]  Henning Fernau,et al.  A Parameterized Perspective on Packing Paths of Length Two , 2008, COCOA.

[4]  Neil Genzlinger.  A. and Q , 2006 .

[5]  Weijia Jia,et al.  An efficient parameterized algorithm for m-set packing , 2004, J. Algorithms.

[6]  Michael R. Fellows,et al.  FPT is P-Time Extremal Structure I , 2005, ACiD.

[7]  Jianer Chen,et al.  Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms , 2006, IWPEC.

[8]  Jianxin Wang,et al.  An O*(3.523k) Parameterized Algorithm for 3-Set Packing , 2008, TAMC.

[9]  Refael Hassin,et al.  Approximation algorithms for some vehicle routing problems , 2005, Discret. Appl. Math..

[10]  Henning Fernau,et al.  A Parameterized Perspective on P2-Packings , 2008, ArXiv.

[11]  R. Ravi,et al.  Approximation algorithms for the test cover problem , 2003, Math. Program..

[12]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[13]  Jianer Chen,et al.  An Improved Parameterized Algorithm for a Generalized Matching Problem , 2008, TAMC.

[14]  Henning Fernau,et al.  NONBLOCKER: Parameterized Algorithmics for minimum dominating set , 2006, SOFSEM.

[15]  David Manlove,et al.  Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms , 2009, ACiD.

[16]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[17]  Jianer Chen,et al.  Improved algorithms for path, matching, and packing problems , 2007, SODA '07.

[18]  Henning Fernau,et al.  2 Contents , 1996 .

[19]  Hannes Moser,et al.  A Problem Kernelization for Graph Packing , 2009, SOFSEM.

[20]  Silvio Micali,et al.  An O(v|v| c |E|) algoithm for finding maximum matching in general graphs , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[21]  Pablo Moscato,et al.  The k-FEATURE SET problem is W[2]-complete , 2003, J. Comput. Syst. Sci..

[22]  Henning Fernau,et al.  A Parameterized Perspective on P 2 -Packings , 2008 .

[23]  Carlos Cotta.  The k-F? S? problem is W[2]-complete , 2003 .

[24]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[25]  Christian Sloper,et al.  Either/Or: Using Vertex Cover Structure in Designing FPT-Algorithms - The Case of k-Internal Spanning Tree , 2003, WADS.

[26]  Jérôme Monnot,et al.  The Pk Partition Problem and Related Problems in Bipartite Graphs , 2007, SOFSEM.

[27]  Refael Hassin,et al.  An Approximation Algorithm for Maximum Packing of 3-Edge Paths , 1997, Inf. Process. Lett..

[28]  Christian Sloper,et al.  Looking at the stars , 2004, Theor. Comput. Sci..

[29]  David G. Kirkpatrick,et al.  On the completeness of a generalized matching problem , 1978, STOC.

[30]  Ján Plesník,et al.  Equivalence between the minimum covering problem and the maximum matching problem , 1984, Discret. Math..

[31]  Refael Hassin,et al.  An approximation algorithm for maximum triangle packing , 2006, Discret. Appl. Math..

[32]  Ioannis Koutis,et al.  Faster Algebraic Algorithms for Path and Packing Problems , 2008, ICALP.

[33]  Venkatesh Raman,et al.  Parameterized complexity of finding subgraphs with hereditary properties , 2000, Theor. Comput. Sci..

[34]  Michael R. Fellows,et al.  Parameterized Complexity: The Main Ideas and Connections to Practical Computing , 2000, Experimental Algorithmics.