Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
Publication:5494962
DOI10.1109/FOCS.2011.23zbMath1292.68122OpenAlexW2059273723MaRDI QIDQ5494962
Michał Pilipczuk, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk, Jesper Nederlof, Johan M. M. van Rooij, Marek Cygan
Publication date: 30 July 2014
Published in: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/focs.2011.23
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)
Related Items (only showing first 100 items - show all)
This page was built for publication: Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time