Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time

DOI10.1145/3506707arXiv1103.0534OpenAlexW2950987206WikidataQ115522516 ScholiaQ115522516MaRDI QIDQ6058244

Michał Pilipczuk, Jakub Onufry Wojtaszczyk, Jesper Nederlof, Marcin Pilipczuk, Johan M. M. van Rooij, Marek Cygan

Publication date: 31 October 2023

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

treewidthSteiner treefeedback vertex setisolation lemmaconnectivity problemsHamilton path/cycle

Mathematics Subject Classification ID

Computer science (68-XX)

Related Items (4)

On the minimum cycle cover problem on graphs with bounded co-degeneracy ⋮ Grouped domination parameterized by vertex cover, twin cover, and beyond ⋮ Kernelization for feedback vertex set via elimination distance to a forest ⋮ Computing generalized convolutions faster than brute force

This page was built for publication: Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time