Pages that link to "Item:Q2465936"
From MaRDI portal
The following pages link to Tree decompositions of graphs: saving memory in dynamic programming (Q2465936):
Displaying 11 items.
- Complexity of finding maximum regular induced subgraphs with prescribed degree (Q401302) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies (Q988687) (← links)
- Memory requirements for table computations in partial \(k\)-tree algorithms (Q1578422) (← links)
- Space saving by dynamic algebraization based on tree-depth (Q2411033) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning (Q2985109) (← links)
- Tree Decompositions of Graphs: Saving Memory in Dynamic Programming (Q3439128) (← links)
- Efficient Problem Solving on Tree Decompositions Using Binary Decision Diagrams (Q3449205) (← links)
- Memory requirements for table computations in partial k-tree algorithms (Q5054858) (← links)
- Path cover problems with length cost (Q6069927) (← links)