A spectral heuristic for bisecting random graphs

Random Structures and Algorithms

Volumn 29, Issue 3, 2006, Pages 351-398

  Coja Oghlan, Amin ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33749354643     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20116     Document Type: Article

References (39)

1. N. Alon and N. Kahale, A spectral technique for coloring random 3-colorable graphs, SIAM J Comput 26 (1997), 1733-1748.
2. S. Arora, S. Rao, and U. Vazirani, Expander flows, geometric embeddings and graph partitioning, Proc 36th STOC (2004), 222-231.
3. B. Bollobás, Random graphs, 2nd ed., Springer-Verlag, 2001.
4. B. Bollobás and A. D. Scott, Max cut for random graphs with a planted partition. Combinator, Probab Comput 13 (2004), 451-474.
5. R. Boppana, Eigenvalues and graph bisection: An average-case analysis, Proc 28th FOCS (1987), 280-285.
6. T. Bui, S. Chaudhuri, T. Leighton, and M. Sipser, Graph bisection algorithms with good average case behavior, Combinatorica 7 (1987), 171-191.
7. T. Carson and R. Impagliazzo, Hill-climbing finds random planted bisections, Proc 12th SODA (2000), 903-909.
8. H. Chen and A. Frieze, Coloring bipartite hypergraphs, Proc 5th IPCO (1996), 345-358.
9. F. Chung, Spectral Graph Theory, American Mathematical Society, 1997.
10. A. Coja-Oghlan, A. Goerdt, A. Lanka, and F. Schädlich, Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SAT, Theor Comp Sci 329 (2004). 1-45.
11. n.p, Random Struct Algor 24 (2004), 259-278.
12. A. Condon and R. M. Karp, Algorithms for graph partitioning on the planted partition model, Random Struct Algor 18 (2001), 116-140.
13. T. Dimitriou and R. Impagliazzo, Go with the winners for graph bisection, Proc 9th SODA (1998), 510-520.
14. W. E. Donath and A. J. Hoffman, Lower bounds for the partitioning of a graph, IBM J Res Dev 17 (1973), 420-425.
15. M. Dyer and A. Frieze, The solution of some random NP-hard problems in polynomial expected time, J Algor 10 (1989), 451-489.
16. U. Feige, Relations between average case complexity and approximation complexity, Proc 24th STOC (2002), 534-543.
17. U. Feige and J. Kilian, Heuristics for semirandom graph problems, J Comput Syst Sci 63 (2001), 639-671.
18. U. Feige and J. Krauthgamer, A polylogarithmic approximation of the minimum bisection, SIAM J Comput 31 (2002), 1090-1118.
19. U. Feige and E. Ofek, Spectral techniques applied to sparse random graphs, Random Struct Algor 27 (2005), 251-275.
20. M. Fiedler, Algebraic connectivity of graphs, Czech Math J 23 (1973), 298-305.
21. P.-O. Fjällström, Algorithms for graph partitioning: A survey, Linköping University Electronic Press, 1998.
22. A. Flaxman, A spectral technique for random satisfiable 3CNF formulas, Proc 14th SODA (2003), 357-363.
23. J. Friedman, J. Kahn, and E. Szemerédi, On the second eigenvalue in random regular graphs, Proc 21st STOC (1989), 587-598.
24. Z. Füredi and J. Komloś, The eigenvalues of random symmetric matrices, Combinatorica 1 (1981), 233-241.
25. M. R. Garey, D. S. Johnson, and L. Stockmeyer, Some simplified NP-complete graph problems, Theoret Comp Sci 1 (1976), 237-267.
26. A. Goerdt and A. Lanka, On the hardness and easiness of random 4-SAT formulas, Proc 15th ISAAC (2004), 470-483.
27. S. Janson, T. Łuczak, and A. Ruciński, Random Graphs, Wiley, 2000.
28. M. Jerrum and G. Sorkin, The metropolis algorithm for graph bisection, Discr Appl Math 82 (1998), 155-175.
29. A. Juels, Topics in black-box combinatorial function optimization. Ph.D. thesis, UC Berkeley, Berkeley, CA, 1996.
30. M. Karpinski, Approximability of the minimum bisection problem: an algorithmic challenge, Proc 27th MFCS (2002), 59-67.
31. S. Knot, Ruling out PTAS for graph min-bisection, densest subgraph and bipartite clique, Proc 45th FOCS (2004), 136-145.
32. M. Krivelevich and B. Sudakov, The largest eigenvalue of sparse random graphs, Combinator Probab Comput 12 (2003), 61-72.
33. L. Kučera, Expected complexity of graph partitioning problems, Disc Appl Math 57 (1995), 193-212.
34. T. Lengauer, Combinatorial algorithms for integrated circuit layout, Wiley & Teubner, 1990.
35. F. McSherry, Spectral Partitioning of Random Graphs, Proc 42nd FOCS (2001), 529-537.
36. A. Pothen, H. D. Simon, and K.-P. Liou, Partitioning sparse matrices with eigenvectors of graphs, SIAM J Matrix Anal Appl 11 (1990), 430-452.
37. K. Schloegel, G. Karypis, and V. Kumar, Graph partitioning for high performance scientific simulations, in J. Dongarra, I. Foster. G. Fox, K. Kennedy, and A. White (editors). CRPC Parallel Computation Handbook, Kaufmann. 2000.
38. N. Sensen. Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows. PhD thesis. Universität Paderborn, 2003.
39. D. A. Spielman and S.-H. Teng, Spectral partitioning works: Planar graphs and finite element meshes. Proc 36th FOCS (1996), 96-105.