On exact algorithms for treewidth
From MaRDI portal
Publication:2933641
DOI10.1145/2390176.2390188zbMath1301.05328WikidataQ59567551 ScholiaQ59567551MaRDI QIDQ2933641
Dieter Kratsch, Hans L. Bodlaender, Fedor V. Fomin, Dimitrios M. Thilikos, Arie M. C. A. Koster
Publication date: 5 December 2014
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2390176.2390188
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
90C39: Dynamic programming
05C85: Graph algorithms (graph-theoretic aspects)