The Parameterized Complexity of the Minimum Shared Edges Problem

DOI10.4230/LIPIcs.FSTTCS.2015.448zbMath1366.68090arXiv1602.01739OpenAlexW2286780640MaRDI QIDQ5275386

Rolf Niedermeier, Manuel Sorge, Stefan Kratsch, Till Fluschnik

Publication date: 13 July 2017

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

zbMATH Keywords

treewidthparameterized complexitykernelizationtreewidth reduction

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (5)

Approximate separable multichoice optimization over monotone systems ⋮ Fractals for Kernelization Lower Bounds ⋮ The complexity of routing with collision avoidance ⋮ Parameterized shifted combinatorial optimization ⋮ The parameterized complexity of the minimum shared edges problem

This page was built for publication: The Parameterized Complexity of the Minimum Shared Edges Problem