Pages that link to "Item:Q2140570"
From MaRDI portal
The following pages link to Faster algorithm for pathwidth one vertex deletion (Q2140570):
Displaying 4 items.
- Faster deterministic algorithms for \textsc{Co-path Packing} and \textsc{Co-path/cycle Packing} (Q2091118) (← links)
- Faster parameterized algorithm for pumpkin vertex deletion set (Q2414055) (← links)
- Smaller kernels for two vertex deletion problems (Q6551719) (← links)
- Parameterized complexity of vertex splitting to pathwidth at most 1 (Q6639742) (← links)