Bounds on the bisection width for random d -regular graphs

Theoretical Computer Science

Volumn 382, Issue 2, 2007, Pages 120-130

  Diaz J ^a   Serna, M J ^a   Wormald, N C ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Bisection width; Random regular graphs

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; ASYMPTOTIC ANALYSIS; BRANCH AND BOUND METHOD; NUMERICAL METHODS; RANDOM PROCESSES;

BISECTION WIDTHS; NUMERICAL APPROXIMATIONS; RANDOM REGULAR GRAPHS; RANDOMIZED GREEDY ALGORITHMS;

GRAPH THEORY;

EID: 34547521525     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.03.003     Document Type: Article

References (25)

1. Alon N. On the edge-expansion of graphs. Combinatorics, Probability and Computing 6 (1997) 145-152
2. Bezrukov S.L., Elsasser R., Monien B., Preis R., and Tillich J.P. New spectral lower bounds on the bisection width of graphs. In: Brandes U., and Wagner D. (Eds). 26th Graph-Theoretic Concepts in Computer Science. Lecture Notes in Computer Science vol. 1928 (2000), Springer 23-34
3. Boettcher S., and Percus A. Extremal optimization for graph partitioning. Physical Review 64 (2001) 26114-1-26114-13
4. Bollobás B. The isoperimetric number of random regular graphs. European Journal of combinatorics 9 (1984) 241-244
5. Bollobás B. Random Graphs. second ed. (2001), Combridge University Press
6. Bui T., Chaudhuri S., Leighton T., and Sipser M. Graph bisection algorithms with good average case behavior. Combinatorica 7 (1987) 171-191
7. Díaz J., Do N., Serna M.J., and Wormald N.C. Bounds on the max and min bisection of random cubic and random 4-regular graphs. Theoretical Computer Science 307 (2003) 531-548
8. Díaz J., Petit J., and Serna M.J. A survey on graph layout problems. ACM Computing Surveys 34 (2002) 313-356
9. U. Feige, R. Krauthgamer, A polylogarithmic approximation of the minimum bisection, in: 41st. IEEE Annual Symposium on Foundation of Computer Science, 2000, pp. 23-26
10. Feige U., Karpinski M., and Langberg M. A note on approximating Max Bisection on regular graphs. Information Processing Letters 79 (2001) 181-188
11. Fiedler M. A property of the eigenvectors of non-negative symmetric matrices and its application to graph theory. Czechoslovak Mathematical Journal 25 (1975) 619-633
12. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman, San Francisco
13. E. Halperin, D. Livnat, U. Zwick, Max Cut in cubic graphs, in: 13th. Symposium on Discrete Algorithms, 2001, pp. 506-513
14. Halperin E., and Zwick U. A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems. Random Structures and Algorithms 20 (2002) 382-402
15. Jansen K., Karpinski M., Lingas A., and Seidel E. Polynomial time approximation schemes for MAX-BISECTION on planar and geometric graphs. In: Ferreira A., and Reichel H. (Eds). 18th. Ann. Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science vol. 2010 (2001), Springer 365-375
16. Jerrum M., and Sorkin G. The Metropolis algorithm for graph bisection. Discrete Applied Mathematics 8 (1998) 155-175
17. Kostochka A.V., and Melnikov L.S. On bounds of the bisection width of cubic graphs. In: Nesetril J., and Fiedler M. (Eds). Fourth Czechoslovakian Symposium on Combinatorics, Graphs and Complexity (1992), Elsevier Science Publishers 151-154
18. Locke S.C. Maximum k-colorable subgraphs. Journal of Graph Theory 6 2 (1982) 123-132
19. Monien B., and Preis R. Upper bounds on the bisection width of 3 and 4-regular graphs. In: Pultr A., Sgall J., and Kolman P. (Eds). Mathematical Foundations of Computer Science. Lecture Notes in Computer Science vol. 2136 (2001), Springer 524-536
20. Shearer J.B. A note on bipartite subgraphs of triangle-free graphs. Random Structures Algorithms 3 2 (1992) 223-226
21. Steger A., and Wormald N.C. Generating random regular graphs quickly. Combinatorics, Probability and Computing 8 (1999) 377-396
22. Wormald N.C. Differential equations for random processes and random graphs. Annals of Applied Probability 5 (1995) 1217-1235
23. Wormald N.C. The differential equation method for random graph processes and greedy algorithms. In: Karoński M., and Prömel H. (Eds). Lectures on Approximation and Randomized Algorithms (1999), PWN, Warsaw 73-155
24. Wormald N.C. Models of random regular graphs. Surveys in Combinatorics (1999), Cambridge University Press 239-298
25. Wormald N.C. Analysis of greedy algorithms on graphs with bounded degree. EuroComb'01 (Barcelona). Discrete Mathematics 273 (2003) 235-260