Given a graph $$G = (V,E)$$ G = ( V , E ) , $$A \subseteq V$$ A ⊆ V , and integers k and $$\ell $$ ℓ , the $$(A,\ell )$$ ( A , ℓ ) -Path Packing problem asks to find k vertex-disjoint paths of length exactly $$\ell $$ ℓ that have endpoints in A and internal points in $$V{\setminus }A$$ V \ A . We study the parameterized complexity of this problem with parameters |A|, $$\ell $$ ℓ , k, treewidth, pathwidth, and their combinations. We present sharp complexity contrasts with respect to these parameters. Among other results, we show that the problem is polynomial-time solvable when $$\ell \le 3$$ ℓ ≤ 3 , while it is NP-complete for constant $$\ell \ge 4$$ ℓ ≥ 4 . We also show that the problem is W[1]-hard parameterized by pathwidth$${}+|A|$$ + | A | , while it is fixed-parameter tractable parameterized by treewidth$${}+\ell $$ + ℓ . Additionally, we study a variant called Short A-Path Packing that asks to find k vertex-disjoint paths of length at most$$\ell $$ ℓ . We show that all our positive results on the exact-length version can be translated to this version and show the hardness of the cases where |A| or $$\ell $$ ℓ is a constant.
Given a graph G = (V, E), A ⊆ V , and integers k and , the (A,)-Path Packing problem asks to find k vertex-disjoint paths of length that have endpoints in A and internal points in V \ A. We study the parameterized complexity of this problem with parameters |A|, , k, treewidth, pathwidth, and their combinations. We present sharp complexity contrasts with respect to these parameters. Among other results, we show that the problem is polynomial-time solvable when ≤ 3, while it is NP-complete for constant ≥ 4. We also show that the problem is W[1]-hard parameterized by pathwidth + |A|, while it is fixed-parameter tractable parameterized by treewidth + .
Given a graph G = (V, E), A ⊆ V , and integers k and , the (A, )-Path Packing problem asks to find k vertex-disjoint paths of length that have endpoints in A and internal points in V \ A. We study the parameterized complexity of this problem with parameters |A|, , k, treewidth, pathwidth, and their combinations. We present sharp complexity contrasts with respect to these parameters. Among other results, we show that the problem is polynomial-time solvable when ≤ 3, while it is NP-complete for constant ≥ 4. We also show that the problem is W[1]-hard parameterized by pathwidth + |A|, while it is fixed-parameter tractable parameterized by treewidth + .
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.