Pages that link to "Item:Q1811082"
From MaRDI portal
The following pages link to On cutting a few vertices from a graph (Q1811082):
Displayed 5 items.
- Approximation algorithms for the weighted \(t\)-uniform sparsest cut and some other graph partitioning problems (Q295639) (← links)
- Heuristics for the data arrangement problem on regular trees (Q498454) (← links)
- A new approximation algorithm for the unbalanced min \(s\)-\(t\) cut problem (Q896163) (← links)
- Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization (Q2343085) (← links)
- Unbalanced graph cuts with minimum capacity (Q2515430) (← links)