Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time

DOI10.1109/FOCS.2011.23zbMath1292.68122MaRDI QIDQ5494962

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

Publication date: 30 July 2014

Published in: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

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

05C85: Graph algorithms (graph-theoretic aspects)

68W20: Randomized algorithms