Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal

Lokshtanov, Daniel, Dániel Marx et al., ‘Probably optimal’: ‘Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal’, Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011, pp 777–789.

conference paper · https://doi.org/10.1137/1.9781611973082.61