Pages that link to "Item:Q2110607"
From MaRDI portal
The following pages link to Hamiltonian cycle parameterized by treedepth in single exponential time and polynomial space (Q2110607):
Displayed 4 items.
- Edge-cut width: an algorithmically driven analogue of treewidth based on edge cuts (Q6039417) (← links)
- Grid recognition: classical and parameterized computational perspectives (Q6156159) (← links)
- Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space (Q6170447) (← links)
- Computing generalized convolutions faster than brute force (Q6185947) (← links)