Finding and certifying a large hidden clique in a semirandom graph
暂无分享,去创建一个
[1] László Lovász,et al. On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.
[2] János Komlós,et al. The eigenvalues of random symmetric matrices , 1981, Comb..
[3] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .
[4] Ferenc Juhász,et al. The asymptotic behaviour of lovász’ ϑ function for random graphs , 1982, Comb..
[5] Charles R. Johnson,et al. Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.
[6] Mark Jerrum,et al. Large Cliques Elude the Metropolis Process , 1992, Random Struct. Algorithms.
[7] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[8] Ravi B. Boppana,et al. Approximating maximum independent sets by excluding subgraphs , 1992, BIT Comput. Sci. Sect..
[9] Joel H. Spencer,et al. Coloring Random and Semi-Random k-Colorable Graphs , 1995, J. Algorithms.
[10] Ludek Kucera,et al. Expected Complexity of Graph Partitioning Problems , 1995, Discret. Appl. Math..
[11] Farid Alizadeh,et al. Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization , 1995, SIAM J. Optim..
[12] Johan Håstad,et al. Clique is hard to approximate within n/sup 1-/spl epsiv// , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[13] Colin McDiarmid,et al. Algorithmic theory of random graphs , 1997 .
[14] Uriel Feige. Randomized graph products, chromatic numbers, and the Lovász ϑ-function , 1997, Comb..
[15] Ari Juels,et al. Hiding Cliques for Cryptographic Security , 1998, SODA '98.
[16] J. Kilian,et al. Heuristics for finding large independent sets, with applications to coloring semi-random graphs , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[17] N. Alon,et al. Finding a large hidden clique in a random graph , 1998 .