The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths

This paper revisits the classical edge-disjoint paths (EDP) problem, where one is given an undirected graph G and a set of terminal pairs P and asks whether G contains a set of pairwise edge-disjoint paths connecting every terminal pair in P . Our aim is to identify structural properties (parameters...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithmica Ročník 83; číslo 2; s. 726 - 752
Hlavní autori:	Ganian, Robert, Ordyniak, Sebastian
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.02.2021 Springer Nature B.V
Predmet:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Cut width Data Structures and Information Theory Graphs Mathematics of Computing Parameter identification Parameterization Polynomials Separators Theory of Computation Edge-disjoint path problem Tree-cut width Feedback edge set Parameterized complexity
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!