The power of cut-based parameters for computing edge disjoint paths

DOI10.1007/978-3-030-30786-8_15OpenAlexW3134833166MaRDI QIDQ2301542

Robert Ganian, Sebastian Ordyniak

Publication date: 24 February 2020

Full work available at URL: https://arxiv.org/abs/1808.03496

zbMATH Keywords

parameterized complexitytreecut widthEdge Disjoint Path problemfeedback edge set

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

FPT and kernelization algorithms for the induced tree problem ⋮ The complexity of routing problems in forbidden-transition graphs and edge-colored graphs ⋮ On structural parameterizations of the bounded-degree vertex deletion problem ⋮ On structural parameterizations of the edge disjoint paths problem

This page was built for publication: The power of cut-based parameters for computing edge disjoint paths