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

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 83; no. 2; pp. 726 - 752
Main Authors:	Ganian, Robert, Ordyniak, Sebastian
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.02.2021 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!