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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithmica Ročník 87; číslo 12; s. 1864 - 1898
Hlavní autori:	Aravind, N. R., Saxena, Roopam
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.12.2025 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!