Engineering multilevel graph partitioning algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6942 LNCS, Issue , 2011, Pages 469-480

  Sanders, Peter ^a   Schulz, Christian ^a  

^a KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GLOBAL SEARCH; GRAPH PARTITIONING ALGORITHMS; LINEAR SOLVER; MAX-FLOW MIN-CUT; MULTI-GRID; MULTI-LEVEL; MULTILEVEL GRAPH PARTITIONING;

GRAPH THEORY;

ALGORITHMS;

EID: 80052791444     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-23719-5_40     Document Type: Conference Paper

References (15)

1. Andersen, R., Lang, K.J.: An algorithm for improving graph partitions. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 651-660. SIAM, Philadelphia (2008)
2. Briggs, W.L., McCormick, S.F.: A multigrid tutorial. Soc. for Ind. Mathe (2000)
3. Fjallstrom, P.O.: Algorithms for graph partitioning: A survey. Linkoping Electronic Articles in Computer and Information Science 3(10) (1998)
4. Holtgrewe, M., Sanders, P., Schulz, C.: Engineering a Scalable High Quality Graph Partitioner. In: 24th IEEE International Parallal and Distributed Processing Symposium (2010)
5. Lang, K., Rao, S.: A flow-based method for improving the expansion or conductance of graph cuts. In: Bienstock, D., Nemhauser, G.L. (eds.) IPCO 2004. LNCS, vol. 3064, pp. 325-337. Springer, Heidelberg (2004)
6. Meyerhenke, H., Monien, B., Sauerwald, T.: A new diffusion-based multilevel algorithm for computing graph partitions of very high quality. In: IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2008, pp. 1-13 (2008)
7. Osipov, V., Sanders, P.: n-Level Graph Partitioning. In: 18th European Symposium on Algorithms (2010); see also arxiv preprint arXiv:1004.4024
8. Pellegrini, F.: Scotch home page, http://www.labri.fr/pelegrin/scotch
9. Picard, J.C., Queyranne, M.: On the structure of all minimum cuts in a network and applications. Mathematical Programming Studies 13, 8-16 (1980)
10. Sanders, P., Schulz, C.: Engineering Multilevel Graph Partitioning Algorithms. Technical report, Karlsruhe Institute of Technology (2010); see ArXiv preprint arXiv:1012.0006v3
11. Schloegel, K., Karypis, G., Kumar, V.: Graph partitioning for high performance scientific simulations. In: Dongarra, J., et al. (eds.) CRPC Par. Comp. Handbook. Morgan Kaufmann, San Francisco (2000)
12. Southwell, R.V.: Stress-calculation in frameworks by the method of "Systematic relaxation of constraints". Proc. Roy. Soc. Edinburgh Sect. A, 57-91 (1935)
13. Walshaw, C.: Multilevel refinement for combinatorial optimisation problems. Annals of Operations Research 131(1), 325-372 (2004)
14. Walshaw, C., Cross, M.: Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm. SIAM Journal on Scientific Computing 22(1), 63-80 (2000)
15. Walshaw, C., Cross, M.: JOSTLE: Parallel Multilevel Graph-Partitioning Software - An Overview. In: Magoules, F. (ed.) Mesh Partitioning Techniques and Domain Decomposition Techniques, pp. 27-58. Civil-Comp Ltd (2007) (invited chapter)