Quality matching and local improvement for multilevel graph-partitioning

Parallel Computing

Volumn 26, Issue 12, 2000, Pages 1609-1634

  Monien, Burkhard ^a   Preis, Robert ^a   Diekmann, Ralf ^b  

^a UNIVERSITY OF PADERBORN   (Germany)

^b Hilti AG   (Liechtenstein)

Author keywords

Bisection width; Graph partitioning; Local improvement; Matching; Multilevel

Indexed keywords

EID: 0012488850     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-8191(00)00049-1     Document Type: Article

References (38)

1. N. Alon, On the edge-expansion of graphs, Combinat. Probab. Comput. 6 (1997) 145-152.
2. 1, isoperimetric inequalities for graphs and superconcentrators, J. Combinat. Theory B 38 (1985) 73-88.
3. D. Avis, A survey of heuristics for the weighted matching problem, Networks 13 (1983) 475-493.
4. S.T. Barnard, H.D. Simon, Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems, Concurrency Practice Experience 6 (2) (1994) 101-117.
5. N. Bouhmala, Impact of different graph coarsening schemes on the quality of the partitions, Technical Report RT98/05-01, University of Neuchatel, Department of Computer Science, 1998.
6. B. Boyens, Schrumpfungstechniken zur effizienten Graphpartitionierung, Diplom-Thesis, Universität Paderborn, Germany, 1998 (in German).
7. T.N. Bui, S. Chaudhuri, F.T. Leighton, M. Sisper, Graph bisection algorithms with good average case behaviour, Combinatorica 7 (2) (1987) 171-191.
8. T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, MIT Press, New York, 1990.
9. R. Diekmann, B. Monien, R. Preis, Using helpful sets to improve graph bisections, in: D.F. Hsu, A.L. Rosenberg, D. Sotteau (Eds.), Interconnection Networks and Mapping and Scheduling Parallel Computations, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 21, AMS, 1995, pp. 57-73.
10. C. Farhat, S. Lanteri, H.D. Simon, TOP/DOMDEC - a software tool for mesh partitioning and parallel processing, J. Comput. Syst. Eng. 6 (1) (1995) 13-26.
11. C.M. Fiduccia, R.M. Mattheyses, A linear-time heuristic for improving network partitions, in: Proceedings of the 19th IEEE Design Automation Conference, 1982, pp. 175-181.
12. M. Fiedler, Algebraic connectivity of graphs, Czech. Math. J. Praha 23 (98) (1973) 298-305.
13. H.N. Gabow, Data structures for weighted matching and nearest common ancestors with linking, in: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, 1990, pp. 434-443.
14. H.N. Gabow, R.E. Tarjan, Faster scaling algorithms for general graph-matching problems, J. ACM 38 (4) (1991) 815-853.
15. M.R. Garey, D.S. Johnson, L. Stockmeyer, Some simplified NP-complete graph problems, Theoret. Comput. Sci. 1 (1976) 237-267.
16. B. Hendrickson, R. Leland, The chaco user's guide: Version 2.0. Technical Report SAND94-2692, Sandia National Laboratories, Albuquerque, NM, 1994.
17. B. Hendrickson, R. Leland, An improved spectral graph partitioning algorithm for mapping parallel computations, SIAM J. Sci. Comput. 16 (2) (1995) 452-469.
18. B. Hendrickson, R. Leland, A multilevel algorithm for partitioning graphs, in: Proceedings of the Supercomputing '95, ACM, 1995.
19. (5/2) algorithm for maximum matching in bipartite graphs, SIAM J. Comput. 2 (1973) 225-231.
20. J. Hromkovič, B. Monien, The bisection problem for graphs of degree 4 (configuring transputer systems), in: Buchmann, Ganzinger, Paul (Eds.), Festschrift zum 60. Geburtstag von Günter Hotz, B.G. Teubner, 1992, pp. 215-234.
21. M. Karpinski, W. Rytter, Fast Parallel Algorithms for Graph Matching Problems, Oxford Lecture Series in Mathematics and its Applications, vol. 9, Oxford University Press, Oxford, 1998.
22. G. Karypis, V. Kumar, Analysis of multilevel graph partitioning, in: Proceeedings of Seventh Supercomputing Conference, 1995.
23. G. Karypis, V. Kumar, A fast and high quality multilevel scheme for partitioning irregular graphs, SIAM J. Sci. Comput., 1998, to appear.
24. G. Karypis, V. Kumar, Multilevel algorithms for multi-constraint graph partitioning, in: Proceedings of 10th Supercomputing Conference, 1998.
25. G. Karypis, V. Kumar, Multilevel k-way partitioning scheme for irregular graphs, J. Parallel Distributed Comput. 48 (1998) 96-129.
26. B.W. Kernighan, S. Lin, An effective heuristic procedure for partitioning graphs, Bell Syst. Tech. J. (1970) 291-307.
27. E.L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York, 1976.
28. L. Lovász, M.D. Plummer, Matching Theory, Annals of Discrete Mathematics, vol. 29, North-Holland Mathematics Studies, 1986.
29. A. Lubotzky, R. Phillips, P. Sarnak, Ramanujan graphs, Combinatorica 8 (3) (1988) 261-277.
30. S. Micali, V.V. Vazirani, An O(√|V| · |E\) algorithm for finding maximum matching in general graphs, in: 21st IEEE Annual Symposium on Foundations of Computer Science (FOCS), 1980, pp. 17-27.
31. B. Monien, R. Diekmann, A local graph partitioning heuristic meeting bisection bounds, in: 8th SIAM Conference on Parallel Processing for Scientific Computing, 1997.
32. F. Pellegrini, J. Roman, SCOTCH: a software package for static mapping by dual recursive bipartitioning of process and architecture graphs, in: Proceedings of the HPCN'96, 1996, pp. 493-498.
33. R. Ponnusamy, N. Mansour, A. Choudhary, G.C. Fox, Graph contraction for mapping data on parallel computers: a quality-cost tradeoff, Sci. Program. 3 (1994) 73-82.
34. A. Pothen, H.D. Simon, K.P. Liu, Partitioning sparse matrices with eigenvectors of graphs, SIAM J. Matrix Anal. Appl. 11 (3) (1990) 430-452.
35. R. Preis, Linear time 1/2-approximation algorithm for maximum weighted matching in general graphs, in: C. Meinel, S. Tison (Eds.), 16th Symposium on Theoretical Aspects of Computer Science (STACS'99), LNCS 1563, 1999, pp. 259-269.
36. R. Preis, R. Diekmann, The PARTY partitioning-library, user guide, version 1.1. Technical Report TR-RSFB-96-024, Universität Paderborn, 1996.
37. R. Preis, R. Diekmann, PARTY - a software library for graph partitioning, in: B.H.V. Topping (Ed.), Advances in Computational Mechanics with Parallel and Distributed Processing, 1997, pp. 63-71.
38. C. Walshaw, M. Cross, M.G. Everett, A localised algorithm for optimising unstructured mesh partitions, Int. J. Supercomput. Appl. 9 (4) (1995) 280-295.