Pages that link to "Item:Q2414055"
From MaRDI portal
The following pages link to Faster parameterized algorithm for pumpkin vertex deletion set (Q2414055):
Displaying 4 items.
- Combining clickstream analyses and graph-modeled data clustering for identifying common response processes (Q823870) (← links)
- Faster deterministic algorithms for \textsc{Co-path Packing} and \textsc{Co-path/cycle Packing} (Q2091118) (← links)
- Faster algorithm for pathwidth one vertex deletion (Q2140570) (← links)
- A tight approximation algorithm for the cluster vertex deletion problem (Q5918432) (← links)
