The following pages link to Unbalanced graph partitioning (Q372961):
Displaying 3 items.
- Approximation algorithms for the weighted \(t\)-uniform sparsest cut and some other graph partitioning problems (Q295639) (← links)
- A new approximation algorithm for the unbalanced min \(s\)-\(t\) cut problem (Q896163) (← links)
- Minimum nonuniform graph partitioning with unrelated weights (Q4610203) (← links)