Graph partitioning using single commodity flows

Journal of the ACM

Volumn 56, Issue 4, 2009, Pages

  Khandekar, Rohit ^a   Rao, Satish ^b,c   Vazirani, Umesh ^b,c  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c 671 Soda Hall   (United States)

Author keywords

Edge separator; Single commodity max flow; Sparse cut; Spectral method

Indexed keywords

COMMODITY FLOW; EDGE-SEPARATOR; FLOW COMPUTATION; GRAPH PARTITIONING; MULTI-COMMODITY FLOW; POLYLOGARITHMIC; RUNNING TIME; SINGLE COMMODITY MAX-FLOW; SPARSE CUT; SPARSEST CUT; SPECTRAL METHOD;

APPROXIMATION ALGORITHMS; SEPARATION; SEPARATORS; SPECTROSCOPY;

GRAPH THEORY;

EID: 68549087041     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1538902.1538903     Document Type: Article

References (28)

1. AHUJA, R., MAGNATI, T., AND ORLIN, J. 1993. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Eaglewood Cliffs.
2. 1, isoperimetric inequalities for graphs, and superconcentrators. J. Combinat. Theory, Ser. B 38, 73-88.
3. 2) time. In Proceedings, IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, 238-247.
4. ARORA, S., AND KALE, S. 2007. A combinatorial, primal-dual approach to semidefinite programs. In Proceedings, ACM Symposium on Theory of Computing. 227-236.
5. ARORA, S., RAO, S., AND VAZIRANI, U. 2004b. Expander flows, geometric embeddings, and graph partitioning. In Proceedings, ACM Symposium on Theory of Computing. ACM, New York, 222- 231.
6. AUMANN, Y., AND RABANI, Y. 1998. An O(log k) approximate max-flow min-cut theorem and approximation algorithm for multi-commodity flows. SIAM J. Comput. 27, 1, 291-301.
7. BALL, K. 1997. An elementary introduction to modern convex geometry. In Flavors of Geometry, S. Levy, Ed. Cambridge University Press, Cambridge, 1-58.
8. 2) time. In Proceedings of the ACM Symposium on Theory of Computing. ACM, New York, 47-55.
9. DONATH, W., AND HOFFMAN, A. J. 1973. Lower bounds for partitioning of graphs. IBM J. Res. Develop. 17, 420-425.
10. FLEISCHER, L. 2000. Approximating fractional multicommodity flow independent of the number of commodities. SIAM J. Discrete Math. 13, 505-520.
11. GARG, N., AND KONEMANN, J. 1998. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In Proceedings of the IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, 300-309.
12. GOLDBERG, A., AND RAO , S. 1998. Beyond the flow decomposition barrier. J. ACM 45, 783-797.
13. HENDRICKSON, B., AND LELAND, R. 1995. An improved spectral graph partitioning algorithm for mapping parallel computations. SIAM J. Sci. Stat. Comput. 16, 2, 452-469.
14. KARYPIS, G., AGGARWAL, R., KUMAR, V., AND SHEKHAR, S. 1997. Multi-level hypergraph partitioning: Applications in VLSI design. In Proceedings of the ACM/IEEE Design Automation Conference. ACM, New York, 526-529.
15. KARYPIS, G., AND KUMAR, V. 1999. A fast and high quality multi-level scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing 20, 359-392.
16. KERNIGHAN, B. W., AND LIN, S. 1970. An efficient heuristic procedure for partitioning graphs. The Bell Systems Tech. J. 29, 2, 291-307.
17. LANG, K. 2005. Fixing two weaknesses of the spectral method. In Proceedings of the Neural Information Processing Systems.
18. LANG, K., AND RAO, S. 1993. Finding near-optimal cuts: An empirical evaluation. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 212-221.
19. LANG, K., AND RAO, S. 2004. A flow-based method for improving the expansion or conductance of graph cuts. In Proceedings of the MPS Conference on Integer Programming and Combinatorial Optimization. 325-337.
20. LEIGHTON, F., AND RAO, S. 1999. Multi-commodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM 46, 6, 787-832.
21. LINIAL, N., LONDON, E., AND RABINOVICH, Y. 1995. The geometry of graphs and some of its algorithmic applications. Combinatorica 15, 2, 215-246.
22. MOTWANI, R. 1989. Expanding graphs and the average-case analysis of algorithms for matchings and related problems. In Proceedings of the ACM Symposium on Theory of Computing. ACM, New York, 550-561.
23. ORECCHIA, L., SCHULMAN, L., VAZIRANI, U. V., AND VISHNOI, N. K. 2008. On partitioning graphs via single commodity flows. In Proceedings of the ACM Symposium on Theory of Computing. ACM, New York, 461-470.
24. SIMON, H., POTHEN, A., AND LIOU, K. P. 1990. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Math. Theory Appl. 11, 3, 430-452.
25. SLEATOR, D. D., AND TARJAN, R. E. 1983. A data structure for dynamic trees. J. Comput. System Sci. 26, 3, 362-391.
26. SPIELMAN, D., AND TENG, S. 2004. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In Proceedings of the ACM Symposium on Theory of Computing. ACM, New York, 81-90.
27. TANNER, R. M. 1984. Explicit concentrators from generalized n-gons. SIAM J. Alg. Disc. Methods 5, 287-293.
28. WALSHAW, C. 2000. The graph partitioning archive. http://staffweb.cms.gre.ac.uk/∼wc06/partition/. RECEIVED AUGUST 2006; REVISED AUGUST 2007 AND FEBRUARY 2009; ACCEPTED MARCH 2009