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

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F19%3A00113728" target="_blank" >RIV/00216224:14330/19:00113728 - isvavai.cz</a>

Result on the web

<a href="https://link.springer.com/book/10.1007/978-3-030-30786-8#about" target="_blank" >https://link.springer.com/book/10.1007/978-3-030-30786-8#about</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-030-30786-8_15" target="_blank" >10.1007/978-3-030-30786-8_15</a>

Result language

angličtina

Original language name

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

Original language description

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) of graphs which allow the efficient solution of EDP without restricting the placement of terminals in P in any way. In this setting, EDP is known to remain NP-hard even on extremely restricted graph classes, such as graphs with a vertex cover of size 3. We present three results which use edge-separator based parameters to chart new islands of tractability in the complexity landscape of EDP. Our first and main result utilizes the fairly recent structural parameter treecut width (a parameter with fundamental ties to graph immersions and graph cuts): we obtain a polynomial-time algorithm for EDP on every graph class of bounded treecut width. Our second result shows that EDP parameterized by treecut width is unlikely to be fixed-parameter tractable. Our final, third result is a polynomial kernel for EDP parameterized by the size of a minimum feedback edge set in the graph.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

—

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2019

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

WG 2019: Graph-Theoretic Concepts in Computer Science

ISBN

9783030307851

ISSN

0302-9743

e-ISSN

—

Number of pages

15

Pages from-to

190-204

Publisher name

Springer

Place of publication

USA

Event location

Spanelsko

Event date

Jan 1, 2019

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

000557920500015