A data structure for dynamic trees
Journal of Computer and System Sciences
Expanding graphs and the average-case analysis of algorithms for matchings and related problems
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Partitioning sparse matrices with eigenvectors of graphs
SIAM Journal on Matrix Analysis and Applications
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
An improved spectral graph partitioning algorithm for mapping parallel computations
SIAM Journal on Scientific Computing
Approximating s-t minimum cuts in Õ(n2) time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Multilevel hypergraph partitioning: application in VLSI domain
DAC '97 Proceedings of the 34th annual Design Automation Conference
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
SIAM Journal on Computing
Beyond the flow decomposition barrier
Journal of the ACM (JACM)
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Finding near-optimal cuts: an empirical evaluation
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
SIAM Journal on Discrete Mathematics
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Expander flows, geometric embeddings and graph partitioning
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
0(\sqrt {\log n)} Approximation to SPARSEST CUT in Õ(n2) Time
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
A combinatorial, primal-dual approach to semidefinite programs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
On partitioning graphs via single commodity flows
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Extensions and limits to vertex sparsification
Proceedings of the forty-second ACM symposium on Theory of computing
Flow-cut gaps for integer and fractional multiflows
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Schism: a workload-driven approach to database replication and partitioning
Proceedings of the VLDB Endowment
A general framework for graph sparsification
Proceedings of the forty-third annual ACM symposium on Theory of computing
Extracting local community structure from local cores
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications
Graph Sparsification by Effective Resistances
SIAM Journal on Computing
Graph partitioning algorithms for optimizing software deployment in mobile cloud computing
Future Generation Computer Systems
Flow-cut gaps for integer and fractional multiflows
Journal of Combinatorial Theory Series B
Large-treewidth graph decompositions and applications
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We show that the sparsest cut in graphs with n vertices and m edges can be approximated within O(log2 n) factor in Õ(m + n3/2) time using polylogarithmic single commodity max-flow computations. Previous algorithms are based on multicommodity flows that take time Õ(m + n2). Our algorithm iteratively employs max-flow computations to embed an expander flow, thus providing a certificate of expansion. Our technique can also be extended to yield an O(log2 n)-(pseudo-) approximation algorithm for the edge-separator problem with a similar running time.