Spectral techniques applied to sparse random graphs

Random Structures and Algorithms

Volumn 27, Issue 2, 2005, Pages 251-275

  Feige, Uriel ^a   Ofek, Eran ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 26944482759     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.20089     Document Type: Article

References (21)

1. N. Alon and N. Kahale, A spectral technique for coloring random 3-colorable graphs, SIAM J Comput, 26(6) (1997), 1733-1748.
2. N. Alon, M. Krivelevich, and B. Sudakov, Finding a large hidden clique in a random graph, Random Structures Algorithms 13(3-4) (1988), 457-466.
3. N. Alon and J. Spencer, The probabilistic method, Wiley, New York, 2002.
4. R. Boppana, Eigenvalues and Graph Bisection: An Average-Case analysis, Proc 28th Annu Symp Foundations of Computer Science 1987, pp. 280-285.
5. H. Chen and A. Frieze, Coloring bipartite hypergraphs, IPCO: 5th Integer Programming and Combinatorial Optimization Conf, 1996, pp. 345-358.
6. A. Coja-Oghlan, The Lovász number of random graphs, Proc 7th Int Workshop Randomization and Approximation Techniques in Computer Science, 2003, pp. 228-239.
7. A. Coja-Oghlan and A. Goerdt and A. Lanka and F. Schadlich, Certifying unsatisfiability of random 2k-sat formulas using approximation techniques, Proc 14th Int Symp Fundamentals of Computation Theory, 2003, pp. 15-26.
8. A. Coja-Oghlan, C. Moore, and V. Sanvalani, Max k-CUT and approximating the chromatic number of random graphs, Proc 30th Int Coll Automata, Languages and Programming, 2003, pp. 200-211.
9. U. Feige, Relations between average case complexity and approximation complexity, Proc 34th Annu ACM Symp Theory of Computing, 2002, pp. 534-543.
10. U. Feige and J. Kilian, Heuristics for semirandom graph problems, J Comput System Sci 63(4) 2001, pp. 639-671.
11. U. Feige and R. Krauthgamer, Finding and certifying a large hidden clique in a semirandom graph, Random Structures Algorithms, 16(2) (2000), 195-208.
12. A. Flaxman, A spectral technique for random satisfiable 3cnf formulas, Proc Fourteenth Annu ACM-SIAM Symp Discrete Algorithms, 2003, pp. 357-363.
13. J. Friedman, J. Kahn, and E. Szemeredi, On the second eigenvalue in random regular graphs, Proc Twenty First Annu ACM Symp Theory of Computing, 1989, pp. 587-598.
14. Z. Furedi and J. Komlos, The eigenvalues of random symmetric matrices, Combinatorica 1(3) (1981), 233-241.
15. M. Goemans and D. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J ACM 42 (1995), 1115-1145.
16. A. Goerdt and M. Krivelevich, Efficient recognition of random unsatisfiable k-SAT instances by spectral methods, STACS, Annu Symp Theoretical Aspects of Computer Science, 2001, pp. 294-304.
17. F. Juhász, The asymptotic behaviour of the Lovász theta function for random graphs, Combinatorica 2(2) (1982), 153-155.
18. M. Krivelevich and B. Sudakov, The largest eigenvalue of sparse random graphs, Combin Probab Comput 12 (2003), 61-72.
19. L. Lovász, On the Shannon capcity of a graph, IEEE Trans Inform Theory IT-25 (1979), 1-7.
20. F. McSherry, Spectral partitioning of random graphs, Proc 42nd Annu Symp Foundations of Computer Science, 2001, pp. 529-537.
21. U. Zwick, Outward rotations: A tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems, Proc 31st Annu ACM Symp Theory of Computing 1999, pp. 679-687.