你即將離開本站

並前往http://www.cs.tau.ac.il/~nogaa/PDFS/clique3.pdf

Finding a large hidden clique in a random graph

The algorithm is based on the spectral properties of the graph. 1 Introduction. A clique in a graph G is a set of vertices any two of which are connected by ...

確定！ 回上一頁

查詢 「Clique graph」的人也找了：

  1. clique定義
    2.
  2. Clique graph
    3.
  3. clique演算法
    4.
  4. Clique NP-complete
    5.
  5. Clique number
    6.
  6. N clique
    7.
  7. Clique problem
    8.
  8. Clique cover
    9.