Graph partitioning with natural cuts

Proceedings - 25th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2011

Volumn , Issue , 2011, Pages 1135-1146

  Delling, Daniel ^a   Goldberg, Andrew V ^a   Razenshteyn, Ilya ^a,b   Werneck, Renato F ^a  

^a MICROSOFT RESEARCH   (United States)

^b MOSCOW STATE UNIVERSITY   (Russian Federation)

Author keywords

algorithms; graph partitioning; maximum flows; minimum cuts; road networks

Indexed keywords

DENSE REGION; GRAPH PARTITIONING; GRAPH SIZES; LOCAL SEARCH HEURISTICS; MAXIMUM FLOWS; MINIMUM CUT; MOUNTAIN PASS; ROAD NETWORK; SECOND PHASE;

ALGORITHMS; DISTRIBUTED PARAMETER NETWORKS; GRAPH THEORY; HEURISTIC ALGORITHMS; ROADS AND STREETS;

MOTOR TRANSPORTATION;

EID: 80053222039     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2011.108     Document Type: Conference Paper

References (37)

1. S. N. Bhatt and F. T. Leighton, "A Framework for Solving VLSI Graph Layout Problems," Journal of Computer and System Sciences, vol. 28, no. 2, pp. 300-343, 1984.
2. V. Kwatra, A. Schödl, I. Essa, G. Turk, and A. Bobick, "Graphcut Textures: Image and Video Synthesis using Graph Cuts," ACM Transactions on Graphics, vol. 22, no. 3, pp. 277-286, 2003.
3. Z. Wu and R. Leahy, "An Optimal Graph Theoretic Approach to Data Clustering: Theory and its Application to Image Segmentation," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 15, no. 11, pp. 1101-1113, 1993.
4. G. Malewicz, M. H. Austern, A. J. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski, "Pregel: A System for Large-Scale Graph Processing," in Proceedings of the 28th ACM symposium on Principles of distributed computing (PODC'09). New York, NY, USA: ACM, 2009, pp. 6-6.
5. D. Delling, P. Sanders, D. Schultes, and D. Wagner, "Engineering Route Planning Algorithms," in Algorithmics of Large and Complex Networks, ser. Lecture Notes in Computer Science, J. Lerner, D. Wagner, and K. Zweig, Eds. Springer, 2009, vol. 5515, pp. 117-139.
6. M. R. Garey and D. S. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.
7. K. Schloegel, G. Karypis, and V. Kumar, "Graph Partitioning for High-Performance Scientific Simulations," in Sourcebook of Parallel Computing, J. Dongarra, I. Foster, G. Fox, W. Gropp, K. Kennedy, L. Torczon, and A. White, Eds. Morgan Kaufmann, 2003, pp. 491-541.
8. C. Walshaw and M. Cross, "JOSTLE: Parallel Multilevel Graph- Partitioning Software - An Overview," in Mesh Partitioning Techniques and Domain Decomposition Techniques, F. Magoulès, Ed. Civil-Comp Ltd., 2007, pp. 27-58.
9. F. Pellegrini and J. Roman, "Scotch: A software package for static mapping by dual recursive bipartitioning of process and architecture graphs," in High-Performance Computing and Networking, ser. Lecture Notes in Computer Science. Springer, 1996, pp. 493-498. [Online]. Available: http://www.springerlink.com/content/fg24302095611p34/
10. G. Karypis and G. Kumar, "A Fast and Highly Quality Multilevel Scheme for Partitioning Irregular Graphs," SIAM Journal on Scientific Computing, vol. 20, no. 1, pp. 359-392, 1999. (Pubitemid 128689516)
11. H. Meyerhenke, B. Monien, and T. Sauerwald, "A new diffusion-based multilevel algorithm for computing graph partitions," Journal of Parallel and Distributed Computing, vol. 69, no. 9, pp. 750-761, 2009.
12. B. Hendrickson and R. Leland, "A Multilevel Algorithm for Partitioning Graphs," in Proceedings of the 1995 ACM/IEEE Conference on Supercomputing (SC'05). ACM Press, 1995, p. 28.
13. R. Preis and R. Diekmann, "The PARTY Partitioning Library, User Guide, " University of Paderborn, Germany, Tech. Rep., 1996, tr-rsfb-96-02.
14. M. Holtgrewe, P. Sanders, and C. Schulz, "Engineering a Scalable High Quality Graph Partitioner," in 24th International Parallel and Distributed Processing Symposium (IPDPS'10). IEEE Computer Society, 2010, pp. 1-12.
15. V. Osipov and P. Sanders, "n-Level Graph Partitioning," in Proceedings of the 18th Annual European Symposium on Algorithms (ESA'10), ser. Lecture Notes in Computer Science. Springer, 2010, pp. 278-289.
16. M. Hilger, E. Köhler, R. H. Möhring, and H. Schilling, "Fast Point-to-Point Shortest Path Computations with Arc-Flags," in The Shortest Path Problem: Ninth DIMACS Implementation Challenge, ser. DIMACS Book, C. Demetrescu, A. V. Goldberg, and D. S. Johnson, Eds. American Mathematical Society, 2009, vol. 74, pp. 41-72.
17. J. Maue, P. Sanders, and D. Matijevic, "Goal-Directed Shortest-Path Queries Using Precomputed Cluster Distances," ACM Journal of Experimental Algorithmics, vol. 14, pp. 3.2:1-3.2:27, 2009.
18. D. Delling, M. Holzer, K. Müller, F. Schulz, and D. Wagner, "High-Performance Multi-Level Routing," in The Shortest Path Problem: Ninth DIMACS Implementation Challenge, ser. DIMACS Book, C. Demetrescu, A. V. Goldberg, and D. S. Johnson, Eds. American Mathematical Society, 2009, vol. 74, pp. 73-92.
19. T. Kieritz, D. Luxen, P. Sanders, and C. Vetter, "Distributed Time-Dependent Contraction Hierarchies," in Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10), ser. Lecture Notes in Computer Science, P. Festa, Ed., vol. 6049. Springer, May 2010.
20. A. V. Goldberg, H. Kaplan, and R. F. Werneck, "Reach for A*: Shortest Path Algorithms with Preprocessing," in The Shortest Path Problem: Ninth DIMACS Implementation Challenge, ser. DIMACS Book, C. Demetrescu, A. V. Goldberg, and D. S. Johnson, Eds. American Mathematical Society, 2009, vol. 74, pp. 93-139.
21. C. M. Fiduccia and R. M. Mattheyses, "A linear-time heuristic for improving network partitions," in Proceedings of the 19th ACM/IEEE Conference on Design Automation, 1982, pp. 175-181.
22. B. W. Kernighan and S. Lin, "An Efficient Heuristic Procedure for Partitioning Graphs," Bell System Technical Journal, vol. 49, no. 2, pp. 291-307, February 1970.
23. R. Andersen and K. J. Lang, "An Algorithm for Improving Graph Partitions," in Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'08), 2008, pp. 651-660.
24. Y. Boykov, O. Veksler, and R. Zabih, "Fast Approximate Energy Minimization via Graph Cuts," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 23, pp. 1222-1239, 2001. (Pubitemid 33137959)
25. D. Pritchard and R. Thurimella, "Fast computation of small cuts via cycle space sampling," ACM Transaction on Algorithms, 2010, to appear.
26. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, and A. Marchetti-Spaccamela, Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties, 2nd ed. Springer, 2002.
27. A. V. Goldberg and R. E. Tarjan, "A New Approach to the Maximum Flow Problem," J. Assoc. Comput. Mach., vol. 35, pp. 921-940, 1988.
28. D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, 1989.
29. F. Glover, "Tabu search and adaptive memory programming: Advances, applications and challenges," in Interfaces in Computer Science and Operations Research, R. S. Barr, R. V. Helgason, and J. L. Kennington, Eds. Kluwer, 1996, pp. 1-75.
30. C. C. Ribeiro, E. Uchoa, and R. F. Werneck, "A hybrid GRASP with perturbations for the Steiner problem in graphs," INFORMS J. Computing, vol. 14, no. 3, pp. 228-246, 2002.
31. M. G. C. Resende and R. F. Werneck, "A hybrid heuristic for the p-median problem," Journal of Heuristics, vol. 10, no. 1, pp. 59-88, 2004.
32. C. Demetrescu, A. V. Goldberg, and D. S. Johnson, Eds., The Shortest Path Problem: Ninth DIMACS Implementation Challenge, ser. DIMACS Book. American Mathematical Society, 2009, vol. 74.
33. PTV AG - Planung Transport Verkehr, "http://www.ptv.de."
34. D. US Census Bureau, Washington, "UA Census 2000 TIGER/Line files," 2002.
35. V. Osipov and P. Sanders, "n-Level Graph Partitioning," 2010. [Online]. Available: http://arxiv.org/abs/1004.4024
36. P. Sanders and C. Schulz, "Engineering Multilevel Graph Partitioning Algorithms," 2010, unpublished. [Online]. Available: http://arxiv.org/abs/ 1012.0006v1
37. C. Walshaw, "The Graph Partitioning Archive." [Online]. Available: http://staffweb.cms.gre.ac.uk/~c.walshaw/partition/