Approximation algorithms for multilevel graph partitioning

Handbook of Approximation Algorithms and Metaheuristics

Volumn , Issue , 2007, Pages 60-1-60-16

  Monien, Burkhard ^a   Preis, Robert ^a   Schamberger, Stefan ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84995589875     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/9781420010749     Document Type: Chapter

References (67)

1. Hendrickson, B. and Leland, R., Amultilevel algorithm for partitioning graphs Supercomputing ’95: Proceedings of the 1995 ACM/IEEE Conference on Supercomputing, ACM Press, New York, NY, 1995, p. 28.
2. Karypis, G. and Kumar, V., Afast and high qualitymultilevel scheme for partitioning irregular graphs, SIAM J. Scientific Comp., 20(1), 359–392, 1998.
3. Karypis, G. and Kumar, V., Multilevel k-way partitioning scheme for irregular graphs, J. Parallel and Dist. Comp., 48, 96, 1998.
4. Gupta, A., Fast and effective algorithms for graph partitioning and sparse matrix reordering, IBM J. Res. Dev., 41, 171, 1997.
5. Ponnusamy, R., Mansour, N., Choudhary, A., and Fox, G. C., Graph contraction for mapping data on parallel computers: a quality-cost tradeoff, Sci. Prog., 3, 73, 1994.
6. Bouhmala, N., Impact of Different Graph Coarsening Schemes on the Quality of the Partitions, TR RT98/05-01, University of Neuchatel, Department of Computer Science, 1998.
7. Monien, B., Preis, R., and Diekmann, R., Quality matching and local improvement for multilevel graph-partitioning, Parallel Comp., 26(12), 1609, 2000.
8. Preis, R., Linear time 12 -approximation algorithm formaximumweightedmatching in general graphs, Proc. STACS, Lecture Notes in Computer Science, Vol. 1563, Springer, Berlin, 1999, p. 259.
9. Drake, D. E. andHougardy, S., Improved linear time approximation algorithms for weighted matchings, Proc. APPROX/RANDOM, Lecture Notes in Computer Science, Vol. 2764, Springer, Berlin, 2003, p. 14.
10. Drake, D. E. and Hougardy, S., Asimple approximation algorithm for theweightedmatching problem, Inf. Proc. Lett., 85(4), 211, 2003.
11. Pettie, S. and Sanders, P., Asimpler linear time 2/3−ϵ approximation formaximumweight matching, Inf. Proc. Lett., 91, 271, 2004.
12. Kernighan, B.W. and Lin, S., An effective heuristic procedure for partitioning graphs, Bell Syst. Tech. J., 291, 1970.
13. Diekmann, R., Monien, B., and Preis, R., Using helpful sets to improve graph bisections, in Interconnection Networks and Mapping and Scheduling Parallel Computations, Vol. 21, Hsu, D. F., Rosenberg, A. L., and Sotteau, D., Eds., DIMACS Series in Disc.Math. and Theor. Comp. Sci., 1995, p. 57.
14. Monien, B. and Diekmann, R., A local graph partitioning heuristic meeting bisection bounds, SIAM Conf. on Parallel Proc. for Scientific Comp., Minneapolis, Minnesota, USA, 1997.
15. Hromkoviˇc, J. andMonien, B., The bisection problem for graphs of degree 4 (configuring transputer systems), in Festschrift zum 60, Geburtstag von Günter Hotz, Buchmann, J., Ganzinger, H., and Paul, W. J., Eds., 1992, p. 215.
16. Monien, B. and Preis, R., Upper bounds on the bisection width of 3- and 4-regular graphs, Proc. Int. Symp. on Mathematical Foundations of Comp. Sci., Lecture Notes in Computer Science, Vol. 2136, Springer, Berlin, 2001, p. 524. J. Disc. Algorithms (to appear).
17. Preis, R., Analyses and Design of Efficient Graph Partitioning Methods, Dissertation, Universität Paderborn, Germany, 2000.
18. Garey, M. R., Johnson, D. S., and Stockmeyer, L., Some simplified NP-complete graph problems, Theor. Comp. Science, 1, 237, 1976.
19. Garey, M. R. and Johnson, D. S., Computers and Intractability—a Guide to the Theory of NP-Completeness, W. H. Freemann, San Francisco, CA, 1979.
20. Simon, H. and Teng, S., How good is recursive bisection, SIAM J. Sci. Comp., 18(5), 1436, 1997.
21. Monien, B. and Schamberger, S., Graph partitioning with the party library: helpful-sets in practice, Proc. Symp. on Comp. Arch. and High Perf. Comp., 2004, p. 198.
22. Liu, J.W.-H., A graph partitioning algorithm by node separators, ACMTrans.Math. Software, 15(5), 198, 1989.
23. Biswas, R. and Oliker, L., PLUM: parallel load balancing for adaptive unstructured meshes, Parallel Dist. Comp., 51(2), 150, 1998.
24. Biswas, R., Das, S. K., and Harvey, D. J., MinEX: a latency-tolerant dynamic partitioner for grid computing applications, Future Generation Comp. Syst., 18(4), 477, 2002.
25. Feige, U., Krauthgamer, R., and Nissim, K., Approximating the minimum bisection size, Proc. STOC, 2000.
26. Feige, U. and Krauthgamer, R., A polylogarithmic approximation of the minimum bisection, SIAM J. Comput., 31(4), 1090, 2002.
27. Bui, T. N., Chaudhuri, S., Leighton, F. T., and Sisper, M., Graph bisection algorithms with good average case behaviour, Combinatorica, 7(2), 171, 1987.
28. Clark, L. H. and Entringer, R. C., The bisection width of cubic graphs, Bull. Australian Math. Soc., 39, 389, 1988.
29. Bollobas, B., The isoperimetric number of random regular graphs, Eur. J. Comb., 9, 241, 1988.
30. Kostochka A. V. and Melnikov, L. S., On bounds of the bisection width of cubic graphs, Proc. Czechoslovakian Symp. on Comb., Graphs and Complexity, 1992, p. 151.
31. Kostochka, A. V. and Melnikov, L. S., On a lower bound for the isoperimetric number of cubic graphs, Proc. Intl. Conf. Probabilistic Methods in Disc. Math., Progress in Pure and Applied Disc. Math., Vol. 1, 1993, p. 251.
32. Leighton, F. T., Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann Publishers, San Francisco, CA, 1992.
33. Bezrukov, S., Elsässer, R., Monien, B., Preis, R., and Tillich J.-P., New spectral lower bounds on the bisection width of graphs, Theor. Comp. Sci., 320, 155, 2004.
34. Chiu, P., Cubic Ramanujan graphs, Combinatorica, 12(3), 275, 1992.
35. Lubotzky, A., Phillips, R., and Sarnak, P., Ramanujan graphs, Combinatorica, 8(3), 261, 1988.
36. Margulis, G. A., Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators, Probl. Inf. Transm., 24(1), 39, 1988.
37. Morgenstern, M., Existence and explicit constructions of q + 1 regular Ramanujan graphs for every prime power q, J. Comb. Theor., Ser. B, 62(1), 44, 1994.
38. Dutt, S., New faster Kernighan-Lin-type graph-partitioning algorithms, Proc. Intl. Conf. on CAD, 1993, p. 370.
39. Fox, G., Williams, R., andMessina, P., Parallel ComputingWorks! Morgan Kaufmann, San Francisco, CA, 1994.
40. Pothen, A., Simon, H., and Liou, K., Partitioning sparse matrices with eigenvectors of graphs, J. Matrix Anal., 11, 430, 1990.
41. Hendrickson, B. and Leland, R., An improved spectral graph partitioning algorithm for mapping parallel computations, SIAM J. Sci. Comp., 16(2), 452, 1995.
42. Hilbert, D., Über die stetige Abbildung einer Linie auf ein Flächenstück, Mathematische Annalen, 38, 459, 1891.
43. Sagan, H., Space Filling Curves, Springer, Berlin, 1994.
44. Zumbusch, G., ParallelMultilevel Methods: Adaptive Mesh Refinement and Load Balancing, Teubner, Wiesbaden, Germany, 2003.
45. Lawler, E. L., Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York, 1976.
46. Lovász, L. and Plummer, M. D., Matching Theory, Annals of Disc. Math., Vol. 29, North-Holland Mathematics Studies, Amsterdam, 1986.
47. Micali, S. and Vazirani, V. V., An O(√ |V| · |E |) algorithm for finding maximum matching in general graphs, Proc. FOCS, 1980, p. 17.
48. Gabow, H. N., Data structures for weighted matching and nearest common ancestors with linking, Proc. SODA, 1990, p. 434.
49. Gabow, H. N. and Tarjan, R. E., Faster scaling algorithms for general graph-matching problems, JACM, 38(4), 815, 1991.
50. Hopcroft, J. and Karp, R. M., An O(n5/2) algorithm for maximum matching in bipartite graphs, SIAM J. Comp., 2, 225, 1973.
51. Karpinski, M. and Rytter, W., Fast Parallel Algorithms for Graph Matching Problems, Oxford Lecture Series in Mathematics and its Applications, Vol. 9, Oxford University Press, Oxford, 1998.
52. Karypis, G. and Kumar, V., Multilevel algorithms for multi-constraint graph partitioning, Proc. Supercomputing Conf., IEEE Computer Society, Washington, DC, USA, 1998 pp. 1-13.
53. Karypis, G. and Kumar, V., Analysis of multilevel graph partitioning, Proc. Supercomputing Conf., ACMPress, New York, NY, USA, 1995, p. 29.
54. Magun, J., Greedy matching algorithms, an experimental study, J. Exp. Algorithmics, 3, 6, 1998.
55. Uehara, R. and Chen, Z.-Z., Parallel approximation algorithms for maximum weighted matching in general graphs, Inf. Proc. Lett., 76, 13, 2000.
56. Avis, D., A survey of heuristics for the weighted matching problem, Networks, 13, 475, 1983.
57. Fiduccia, C. M. and Mattheyses, R. M., A linear-time heuristic for improving network partitions, Proc. DAC, 1982, p. 175.
58. Hendrickson, B. and Leland, R., The Chaco User’s Guide: Version 2.0, TR SAND94-2692, Sandia National Laboratories, Albuquerque, NM, 1994.
59. Walshaw, C., The Jostle User Manual: Version 2.2, University of Greenwich, London, 2000.
60. Karypis, G. and Kumar, V., METIS Manual, Version 4.0, University of Minnesota, Department of Computer Science, 1998.
61. Pellegrini, F., SCOTCH 3.1 User’s Guide, TR 1137-96, LaBRI, University of Bordeaux, 1996.
62. Karypis, G. and Kumar, V., A coarse-grain parallel formulation of multilevel k-way graphpartitioning algorithm, Proc. SIAM Conf. on Parallel Processing for Scientific Comp., Minneapolis, Minnesota, USA, 1997.
63. Walshaw, C., Cross, M., and Everett, M. G., Parallel dynamic graph partitioning for adaptive unstructured meshes, J. Parallel Dist. Comp., 47(2), 102, 1997.
64. Walshaw, C. and Cross, M., Mesh partitioning: A multilevel balancing and refinement algorithm, SIAM J. Scientific Comp., 22(1), 63, 2000.
65. Elsner, U., Static and Dynamic Graph Partitioning. A Comparative Study of Existing Algorithms, Ph.D. Thesis, Technical University Chemnitz, 2002.
66. Schamberger, S., Improvements to the helpful-set heuristic and a new evaluation scheme for graphs-partitioners Intl. Conf. on Computational Science and its Appl., Lecture Notes in Computer Science, Vol. 2667, Springer, Berlin, 2003, p. 49.
67. Hendrickson, B., Graph partitioning and parallel solvers: has the emperor no clothes? in Solving Irregulary Structured Problems in Parallel, Ferreira, A., Rolim, J., Simon, H., and Teng, S.-H., Lecture Notes in Computer Science, Vol. 1457, Springer, Berlin, 1998, p. 218.