DeepAI AI Chat
Log In Sign Up

Parameterized Complexity of Path Set Packing

by   N. R. Aravind, et al.

In PATH SET PACKING, the input is an undirected graph G, a collection P of simple paths in G, and a positive integer k. The problem is to decide whether there exist k edge-disjoint paths in P. We study the parameterized complexity of PATH SET PACKING with respect to both natural and structural parameters. We show that the problem is W[1]-hard with respect to vertex cover plus the maximum length of a path in P, and W[1]-hard respect to pathwidth plus maximum degree plus solution size. These results answer an open question raised in COCOON 2018. On the positive side, we show an FPT algorithm parameterized by feedback vertex set plus maximum degree, and also show an FPT algorithm parameterized by treewidth plus maximum degree plus maximum length of a path in P. Both the positive results complement the hardness of PATH SET PACKING with respect to any subset of the parameters used in the FPT algorithms.


page 1

page 2

page 3

page 4


Parameterized Complexity of (A,ℓ)-Path Packing

Given a graph G = (V,E), A ⊆ V, and integers k and ℓ, the (A,ℓ)-Path Pac...

On r-Simple k-Path and Related Problems Parameterized by k/r

Abasi et al. (2014) and Gabizon et al. (2015) studied the following prob...

The Complexity of Packing Edge-Disjoint Paths

We introduce and study the complexity of Path Packing. Given a graph G a...

Parameterized Complexity of Simultaneous Planarity

Given k input graphs G_1, … ,G_k, where each pair G_i, G_j with i ≠ j sh...

On Structural Parameterizations of the Offensive Alliance Problem

The Offensive Alliance problem has been studied extensively during the l...

Anticoncentration versus the number of subset sums

Let w⃗ = (w_1,…, w_n) ∈ℝ^n. We show that for any n^-2≤ϵ≤ 1, if #{ξ⃗...

The b-branching problem in digraphs

In this paper, we introduce the concept of b-branchings in digraphs, whi...