Pages that link to "Item:Q2445900"
From MaRDI portal
The following pages link to An \(O^\ast(1.84^k)\) parameterized algorithm for the multiterminal cut problem (Q2445900):
Displayed 5 items.
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
- Parameterized complexity of critical node cuts (Q517024) (← links)
- Edge bipartization faster than \(2^k\) (Q666655) (← links)
- Parameterized complexity of happy coloring problems (Q2192381) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)