Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution

DOI10.1007/978-3-642-04128-0_51zbMath1256.68157WikidataQ59567694 ScholiaQ59567694MaRDI QIDQ3639275

Hans L. Bodlaender, Johan M. M. van Rooij, Peter Rossmanith

Publication date: 29 October 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04128-0_51

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68W05: Nonnumerical algorithms

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

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)