Journal of Shanghai Jiaotong University ›› 2017, Vol. 51 ›› Issue (10): 1202-1206.doi: 10.16183/j.cnki.jsjtu.2017.10.008

Previous Articles     Next Articles

 Algorithm for Relatively Small Planted Clique with
 Small Edge Probability

 HUANG Xuangui   

  1.  Laboratory of BASICS, Shanghai Jiao Tong University, Shanghai 200240, China
  • Online:2017-10-31 Published:2017-10-31
  • Supported by:
     

Abstract:  Planted clique problem is a central problem in averagecase complexity theory. The random graph with planted clique model is extended, and small edge probability conditions are invented to allow the edge probability to decrease. It is shown that under such conditions there exists a polynomialtime randomized algorithm to find a relatively small planted clique by using probability tools for analysis of randomized algorithms. The result improves analysis of the algorithm in the literature.

Key words:  , random graph, planted clique, small edge probability, randomized algorithm, average case complexity

CLC Number: