Pages that link to "Item:Q972340"
From MaRDI portal
The following pages link to Dynamic programming and planarity: improved tree-decomposition based algorithms (Q972340):
Displaying 10 items.
- Revisiting dynamic programming for finding optimal subtrees in trees (Q856203) (← links)
- Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm (Q1373746) (← links)
- Finding Paths in Grids with Forbidden Transitions (Q2827809) (← links)
- The Fine Details of Fast Dynamic Programming over Tree Decompositions (Q2867071) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms (Q3508575) (← links)
- Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base (Q4018150) (← links)
- Improving TSP Tours Using Dynamic Programming over Tree Decompositions (Q4973050) (← links)
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth (Q5042454) (← links)
- DynASP2.5: Dynamic Programming on Tree Decompositions in Action (Q5111876) (← links)
