Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Alon, N., Kahale, N.: A spectral technique for coloring random 3-colorable graphs. SIAM J. Comput. 26(6), 1733–1748 (1997)
2. Lecture Notes in Computer Science;J. Böttcher,2005
3. Coja-Oghlan, A.: A spectral heuristic for bisecting random graphs. In: Proceedings of 16th ACM-SIAM Symp. on Discrete Algorithms (SODA 2005), pp. 850–859 (2005)
4. Lecture Notes in Computer Science;A. Coja-Oghlan,2006
5. Lecture Notes in Computer Science;A. Coja-Oghlan,2003
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Spectral Analysis of Random Sparse Matrices;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2011