Unbalanced graph partitioning
From MaRDI portal
Publication:372961
DOI10.1007/s00224-012-9436-xzbMath1286.68239MaRDI QIDQ372961
Publication date: 21 October 2013
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-012-9436-x
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- Some simplified NP-complete graph problems
- Cut problems in graphs with a budget constraint
- Multicriteria global minimum cuts
- Unbalanced Graph Partitioning
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- Euclidean distortion and the sparsest cut
- Community structure in social and biological networks
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Algorithms – ESA 2005
- Expander flows, geometric embeddings and graph partitioning