An algorithm for improving graph partitions

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 651-660

  Andersen, Reid ^a   Lang, Kevin J ^b  

^a MICROSOFT RESEARCH   (United States)

^b YAHOO RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FLOW PROBLEMS; GRAPH PARTITIONING; RUNNING TIME;

ALGORITHMS;

EID: 58449123872     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)

1. N. Alon and V. Milman. Isoperimetric inequalities for graphs and superconcentrators. J. Combin. Theory B, 38:73-88, 1985.
2. S. Arora, S. Rao, and U. Vazirani. Expander flows, geometric embeddings and graph partitioning. In STOC '04: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, pages 222-231, New York, NY, USA, 2004. ACM Press.
3. M. Balinski. On a selection problem. Management Science, (17):230-231, 1970.
4. S. Bhatt and F. Leighton. A framework for solving vlsi graph layout problems. J. Computer Systems Sciences, 28:300-343, 1984.
5. R. B. Boppana. Eigenvalues and graph bisection: An average-case analysis (extended abstract). In FOCS, pages 280-285, 1987.
6. C. Borgs, J. T. Chayes, M. Mahdian, and A. Saberi. Exploring the community structure of newsgroups. In KDD, pages 783-787, 2004.
7. Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. In ICCV (1), pages 377-384, 1999.
8. T. Bui, S. Chaudhuri, F. T. Leighton, and M. Sipser. Graph bisection algorithms with good average case behavior. In FOCS, pages 181-192, 1984.
9. J. Carrasco, D. Fain, K. Lang, and L. Zhukov. Clustering of bipartite advertiser-keyword graph, 2003.
10. F. Chung. Spectral graph theory, volume Number 92 in CBMS Regional Conference Series in Mathematics. American Mathematical Society, 1997.
11. A. Dasgupta, J. E. Hopcroft, R. Kannan, and P. P. Mitra. Spectral clustering by recursive partitioning. In ESA, pages 256-267, 2006.
12. T. Dimitriou and R. Impagliazzo. Go with the winners for graph bisection. In SODA: ACM-SIAM Symposium on Discrete Algorithms, 1998.
13. U. Feige, D. Peleg, and G. Kortsarz. The dense k-subgraph problem. Algorithmica, 29(3):410-421, 2001.
14. C. M. Fiduccia and R. M. Mattheyses. A linear-time heuristic for improving network partitions. In DAC '82: Proceedings of the 19th conference on Design automation, pages 175-181, Piscataway, NJ, USA, 1982. IEEE Press.
15. G. Gallo, M. D. Grigoriadis, and R. E. Tarjan. A fast parametric maximum flow algorithm and applications. SIAM J. Comput., 18(1):30-55, 1989.
16. M. R. Garey and D. S. Johnson. Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York, 1979.
17. A. Goldberg. Finding a maximum density subgraph. Technical Report UCB CSD 84/71, University of California, Berkeley, 1984.
18. C. Harrelson, K. Hildrum, and S. Rao. A polynomial-time tree decomposition to minimize congestion. In SPAA '03: Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures, pages 34-43, New York, NY, USA, 2003. ACM Press.
19. M. Jerrum and G. B. Sorkin. Simulated annealing for graph bisection. In IEEE Symposium on Foundations of Computer Science, pages 94-103, 1993.
20. D. S. Johnson, C. R. Aragon, L. A. McGeoch, and C. Shevon. Optimization by simulated annealing: An experimental evaluation; part i, graph partitioning. Operations Research, 37(6):865-892, 1989.
21. R. Kannan, S. Vempala, and A. Vetta. On clusterings: Good, bad and spectral. J. ACM, 51(3):497-515, 2004.
22. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput., 20(1):359-392, 1998.
23. B. Kernighan and S. Lin. An effective heuristic procedure for partitioning graphs. The Bell System Technical Journal, pages 291-308, 1970.
24. K. Lang and S. Rao. A flow-based method for improving the expansion or conductance of graph cuts. In IPCO, pages 325-337, 2004.
25. F. T. Leighton and S. Rao. An approximate maxflow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In FOCS, pages 422-431, 1988.
26. M. Narasimhan and J. Bilmes. Local search for balanced submodular clusterings. In IJCAI, pages 981-986, 2007.
27. S. B. Patkar and H. Narayanan. Improving graph partitions using submodular functions. Discrete Appl. Math., 131(2):535-553, 2003.
28. J.-C. Picard and M. Queyranne. Selected applications of minimum cuts in networks. INFORM, 20(4):394-422, 1982.
29. A. Pothen, II. Sirnon, and K. Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM Journal of Matrix Analysis and Applications, 11:430-452, 1990.
30. J. Rhys. A selection problem of shared fixed costs and network flows. Management Science, (17):200-207, 1970.
31. D. Shmoys. Cut problems and their applications to divide-and-conquer, 1996.
32. H. D. Simon and S.-H. Teng. How good is recursive bisection? SIAM Journal on Scientific Computing, 18(5):1436-1445, 1997.
33. A. J. Soper, C. Walshaw, and M. Cross. A combined evolutionary search and multilevel approach to graph partitioning. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2000), pages 674-681, Las Vegas, Nevada, USA, 10-12 2000. Morgan Kaufmann.