Unbalanced Graph Partitioning
From MaRDI portal
Publication:3060735
DOI10.1007/978-3-642-17517-6_21zbMath1310.68244OpenAlexW1507187775MaRDI QIDQ3060735
Publication date: 9 December 2010
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-17517-6_21
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items
Approximation algorithms for the weighted \(t\)-uniform sparsest cut and some other graph partitioning problems ⋮ Unbalanced graph partitioning ⋮ A new approximation algorithm for the unbalanced min \(s\)-\(t\) cut problem ⋮ Unbalanced graph cuts with minimum capacity ⋮ Unnamed Item ⋮ Unnamed Item