Pages that link to "Item:Q4601909"
From MaRDI portal
The following pages link to On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs. (Q4601909):
Displaying 6 items.
- Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies (Q988687) (← links)
- Space-efficient algorithms for longest increasing subsequence (Q1987516) (← links)
- Width, depth, and space: tradeoffs between branching and dynamic programming (Q2287480) (← links)
- Space-Efficient Algorithms for Longest Increasing Subsequence (Q3304143) (← links)
- Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations. (Q5009611) (← links)
- Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space (Q6170447) (← links)