181K - views

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 vertices First choose random graph Gn 1 and then choose randomly subset of vertice

Embed :
Pdf Download Link

Download Pdf - The PPT/PDF document "Finding Large Hidden Clique in Random Gr..." is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.

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






Presentation on theme: "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"— Presentation transcript:

pdf