The Fine Details of Fast Dynamic Programming over Tree Decompositions

DOI10.1007/978-3-319-03898-8_5zbMath1406.68067WikidataQ59567522 ScholiaQ59567522MaRDI QIDQ2867071

Hans L. Bodlaender, Daniel Lokshtanov, Paul Bonsma

Publication date: 10 December 2013

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-03898-8_5

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C05: Trees

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

90C39: Dynamic programming

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C85: Graph algorithms (graph-theoretic aspects)