PDF-Finding Large Hidden Clique in Random Graph Noga lon Michael Krivelevich and Benny Sudakov Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University Tel Aviv
tauacil krivelev mathtauacil sudakov mathtauacil Recei ed ctober 1997 accepted 15 June 1998 ABSTRACT We consider the following probabilistic model of graph on labeled
Download Presentation
"Finding Large Hidden Clique in Random Graph Noga lon Michael…" is the property of its rightful owner. Permission is granted to download and print materials on this website for personal, non-commercial use only, provided you retain all copyright notices. By downloading content from our website, you accept the terms of this agreement.
Presentation Transcript
Transcript not available.