The Fine Details of Fast Dynamic Programming over Tree Decompositions

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

Daniel Lokshtanov, Paul Bonsma, Hans L. Bodlaender

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

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (11)

Unnamed Item ⋮ On the k-rainbow domination in graphs with bounded tree-width ⋮ Unnamed Item ⋮ Space-efficient vertex separators for treewidth ⋮ Parameterized complexity of happy coloring problems ⋮ Unnamed Item ⋮ Sketched representations and orthogonal planarity of bounded treewidth graphs ⋮ Orthogonal planarity testing of bounded treewidth graphs ⋮ \(H\)-colouring \(P_t\)-free graphs in subexponential time ⋮ Using contracted solution graphs for solving reconfiguration problems ⋮ Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs

This page was built for publication: The Fine Details of Fast Dynamic Programming over Tree Decompositions