Parameterized Complexity of Path Set Packing

In Path Set Packing , the input is an undirected graph G , a collection of simple paths in G , and a positive integer k . The problem is to decide whether there exist k edge-disjoint paths in . We study the parameterized complexity of Path Set Packing with respect to both natural and structural para...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 87; no. 12; pp. 1864 - 1898
Main Authors:	Aravind, N. R., Saxena, Roopam
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.12.2025 Springer Nature B.V
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Combinatorial analysis Complexity Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Feedback Mathematics of Computing Parameterization Parameters Theory of Computation Path set packing Graph algorithms Parameterized complexity Set packing Fixed parameter tractability
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!