The Fine Details of Fast Dynamic Programming over Tree Decompositions
From MaRDI portal
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39)
Recommendations
- Practical access to dynamic programming on tree decompositions
- Practical access to dynamic programming on tree decompositions
- Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
- Dynamic programming and planarity: improved tree-decomposition based algorithms
- Revisiting dynamic programming for finding optimal subtrees in trees
- DynASP2.5: Dynamic Programming on Tree Decompositions in Action
- Improving the efficiency of dynamic programming on tree decompositions via machine learning
- Nonserial Dynamic Programming and Tree Decomposition in Discrete Optimization
- scientific article; zbMATH DE number 4060712
- Tree Decompositions of Graphs: Saving Memory in Dynamic Programming
Cited in
(35)- Practical access to dynamic programming on tree decompositions
- Optimal tree decompositions revisited: a simpler linear-time FPT algorithm
- Orthogonal planarity testing of bounded treewidth graphs
- Space-efficient vertex separators for treewidth
- Parameterized complexity of happy coloring problems
- Sketched representations and orthogonal planarity of bounded treewidth graphs
- Breaking the linear-memory barrier in MPC: fast MIS on trees with strongly sublinear memory
- \(H\)-colouring \(P_t\)-free graphs in subexponential time
- Using contracted solution graphs for solving reconfiguration problems
- Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions
- Positive-instance driven dynamic programming for treewidth
- Tree decompositions of graphs: saving memory in dynamic programming
- Speeding up dynamic programming with representative sets. An experimental evaluation of algorithms for Steiner Tree on tree decompositions
- Improving the efficiency of dynamic programming on tree decompositions via machine learning
- scientific article; zbMATH DE number 2086260 (Why is no real title available?)
- scientific article; zbMATH DE number 7228418 (Why is no real title available?)
- Efficient problem solving on tree decompositions using binary decision diagrams
- Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
- Solving the problem of finding an independent \(\{K_1,K_2\}\)-packing of maximum weight on graphs of bounded treewidth
- Space saving by dynamic algebraization
- Practical access to dynamic programming on tree decompositions
- Fast Algorithms for Join Operations on Tree Decompositions
- On the \(k\)-rainbow domination in graphs with bounded tree-width
- DynASP2.5: Dynamic Programming on Tree Decompositions in Action
- Nonserial Dynamic Programming and Tree Decomposition in Discrete Optimization
- Dynamic Programming and Fast Matrix Multiplication
- Fine-grained complexity of the graph homomorphism problem for bounded-treewidth graphs
- scientific article; zbMATH DE number 7651213 (Why is no real title available?)
- Composing dynamic programming tree-decomposition-based algorithms
- An efficient algorithm to compute the toughness in graphs with bounded treewidth
- Efficient diagonalization of symmetric matrices associated with graphs of small treewidth
- Polynomial-time algorithms for \textsc{Path Cover} on trees and graphs of bounded treewidth
- Revisiting dynamic programming for finding optimal subtrees in trees
- Dynamic programming and planarity: improved tree-decomposition based algorithms
This page was built for publication: The Fine Details of Fast Dynamic Programming over Tree Decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867071)
