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 5 items.
- Complexity of finding maximum regular induced subgraphs with prescribed degree (Q401302) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- Efficient Problem Solving on Tree Decompositions Using Binary Decision Diagrams (Q3449205) (← links)
- Path cover problems with length cost (Q6069927) (← links)
