Pages that link to "Item:Q856203"
From MaRDI portal
The following pages link to Revisiting dynamic programming for finding optimal subtrees in trees (Q856203):
Displaying 11 items.
- Dynamic programming and planarity: improved tree-decomposition based algorithms (Q972340) (← links)
- An improved algorithm for finding a length-constrained maximum-density subtree in a tree (Q975556) (← links)
- The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation (Q987675) (← links)
- Positive-instance driven dynamic programming for treewidth (Q2424727) (← links)
- Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem (Q2434979) (← links)
- The Fine Details of Fast Dynamic Programming over Tree Decompositions (Q2867071) (← links)
- Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems (Q3502673) (← links)
- An Analysis of a Good Algorithm for the Subtree Problem, Corrected (Q3833624) (← links)
- (Q4381299) (← links)
- DynASP2.5: Dynamic Programming on Tree Decompositions in Action (Q5111876) (← links)
- Weighted target set selection on trees and cycles (Q6087138) (← links)
