Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Alon, N., Kahale, N.: A spectral technique for coloring random 3-colorable graphs. SIAM J. Comput. 26, 1733–1748 (1997)
2. Alon, N., Krivelevich, M., Sudakov, B.: Finding a large hidden clique in a random graph. Random Structures and Algorithms 13, 457–466 (1998)
3. Boppana, R.: Eigenvalues and graph bisection: an average-case analysis. In: Proc. 28th FOCS, pp. 280–285 (1987)
4. Lecture Notes in Computer Science;H. Chen,1996
5. Coja-Oghlan, A.: A spectral heuristic for bisecting random graphs. In: Proc.16th SODA, pp. 850–859 (2005)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the Security of Goldreich’s One-Way Function;Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques;2009
2. Spectral Clustering by Recursive Partitioning;Lecture Notes in Computer Science;2006
3. A Spectral Method for MAX2SAT in the Planted Solution Model;Algorithms and Computation