Pages that link to "Item:Q2287480"
From MaRDI portal
The following pages link to Width, depth, and space: tradeoffs between branching and dynamic programming (Q2287480):
Displaying 4 items.
- A polynomial excluded-minor approximation of treedepth (Q2119392) (← links)
- Trade-Offs between Depth and Width in Parallel Computation (Q3691060) (← links)
- On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs. (Q4601909) (← links)
- Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel (Q5048303) (← links)