Upper bounds on the bisection width of 3- and 4-regular graphs

Journal of Discrete Algorithms

Volumn 4, Issue 3, 2006, Pages 475-498

  Monien, Burkhard ^a   Preis, Robert ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

Bisection width; Graph partitioning; Local improvement; Regular graphs

Indexed keywords

ALGORITHMS; FUNCTION EVALUATION; NUMBER THEORY;

BISECTION WIDTH; GRAPH PARTITIONING; LOCAL IMPROVEMENT; REGULAR GRAPHS;

GRAPH THEORY;

EID: 33747813183     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2005.12.009     Document Type: Article

References (28)

1. Alon N. On the edge-expansion of graphs. Combinator. Probab. Comput. 6 (1997) 145-152
2. Bui T.N., Chaudhuri S., Leighton F.T., and Sisper M. Graph bisection algorithms with good average case behaviour. Combinatorica 7 2 (1987) 171-191
3. Bezroukov S.L., Elsässer R., Monien B., Preis R., and Tillich J.-P. New spectral lower bounds on the bisection width of graphs. Workshop on Graph-Theoretic Concepts in Computer Science (WG). Lecture Notes in Comput. Sci. vol. 1928 (2000), Springer, Berlin 23-34
4. C.F. Bornstein, A. Litman, B.M. Maggs, R.K. Sitaraman, T. Yatzkar, On the bisection width and expansion of butterfly networks, in: Proc. Int. Parallel Processing Symp. (IPPS), 1998, pp. 144-150
5. Bollobas B. The isoperimetric number of random regular graphs. European J. Combin. 9 (1988) 241-244
6. Clark L.H., and Entringer R.C. The bisection width of cubic graphs. Bull. Austral. Math. Soc. 39 (1988) 389-396
7. Chiu P. Cubic Ramanujan graphs. Combinatorica 12 3 (1992) 275-285
8. Diekmann R., Monien B., and Preis R. Using helpful sets to improve graph bisections. In: Hsu D.F., Rosenberg A.L., and Sotteau D. (Eds). Interconnection Networks and Mapping and Scheduling Parallel Computations. DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 21 (1995), AMS 57-73
9. Fiedler M. A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czechoslovak Math. J. 25 100 (1975) 619-633
10. U. Feige, R. Krauthgamer, A polylogarithmic approximation of the minimum bisection, in: Proc. Symp. on Foundations of Computer Science (FOCS), 2000, pp. 105-115
11. Garey M.R., Johnson D.S., and Stockmeyer L. Some simplified NP-complete graph problems. Theoret. Comput. Sci. 1 (1976) 237-267
12. B. Hendrickson, R. Leland, The chaco user's guide: Version 2.0, Technical Report SAND94-2692, Sandia National Laboratories, Albuquerque, NM, 1994
13. Hromkovič J., and Monien B. The bisection problem for graphs of degree 4 (configuring transputer systems). In: Buchmann J., Ganzinger H., and Paul W.J. (Eds). Festschrift zum 60. Geburtstag von Günter Hotz (1992), Teubner 215-234
14. Holton D.A., and Sheehan J. The Petersen Graph (1993), Cambridge University Press, Cambridge
15. Karypis G., and Kumar V. METIS Manual, Version 4.0 (1998), University of Minnesota, Department of Computer Science
16. Kostochka A.V., and Melnikov L.S. On bounds of the bisection width of cubic graphs. In: Nesetril J., and Fiedler M. (Eds). Proc. Fourth Czechoslovakian Symp. on Combinatorics, Graphs and Complexity (1992), Elsevier Science, Amsterdam 151-154
17. Kostochka A.V., and Melnikov L.S. On a lower bound for the isoperimetric number of cubic graphs. In: Kolchin V.F., et al. (Ed). Probabilistic Methods in Discrete Mathematics, Proc. third Int. Petrozavodsk Conf. Progress in Pure and Applied Discrete Mathematics vol. 1 (1993), TVP/VSP 251-265
18. Lubotzky A., Phillips R., and Sarnak P. Ramanujan graphs. Combinatorica 8 3 (1988) 261-277
19. 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 (1988) 39-46
20. B. Monien, R. Diekmann, A local graph partitioning heuristic meeting bisection bounds, in: 8th SIAM Conf. on Parallel Processing for Scientific Computing, 1997
21. Manabe Y., Hagihara K., and Tokura N. The minimum bisection widths of the cube-connected cycles graph and cube graph. Trans. IEICE J67-D 6 (1994) 647-654 (in Japanese)
22. Morgenstern M. Existence and explicit constructions of q + 1 regular Ramanujan graphs for every prime power q. J. Combin. Theory Ser. B 62 1 (1994) 44-62
23. Monien B., and Preis R. Bisection width of 3- and 4-regular graphs. 26th International Symposium on Mathematical Foundations of Computer Science (MFCS). Lecture Notes in Comput. Sci. vol. 2136 (2001), Springer, Berlin 524-536
24. Monien B., Preis R., and Diekmann R. Quality matching and local improvement for multilevel graph-partitioning. Parallel Comput. 26 12 (2000) 1609-1634
25. R. Preis, R. Diekmann, The PARTY partitioning-library, user guide, version 1.1, Technical Report TR-RSFB-96-024, Universität Paderborn, 1996
26. F. Pellegrini, SCOTCH 3.1 user's guide, Technical Report 1137-96, LaBRI, University of Bordeaux, 1996
27. R. Preis, Analyses and design of efficient graph partitioning methods, Heinz Nixdorf Institut Verlagsschriftenreihe, Dissertation, Universität Paderborn, Germany, 2000
28. Walshaw C. The Jostle User Manual: Version 2.2 (2000), University of Greenwich