Graph partitioning using single commodity flows
Authors:
Open Access
- 21 May 2006
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 385-390
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- 0(\sqrt {\log n)} Approximation to SPARSEST CUT in Õ(n²) Time2004
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithmsJournal of the ACM, 1999
- Beyond the flow decomposition barrierJournal of the ACM, 1998
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular GraphsSIAM Journal on Scientific Computing, 1998
- Multilevel hypergraph partitioning1997
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel ComputationsSIAM Journal on Scientific Computing, 1995
- Partitioning Sparse Matrices with Eigenvectors of GraphsSIAM Journal on Matrix Analysis and Applications, 1990
- λ1, Isoperimetric inequalities for graphs, and superconcentratorsJournal of Combinatorial Theory, Series B, 1985
- Explicit Concentrators from Generalized N-GonsSIAM Journal on Algebraic Discrete Methods, 1984
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970