你即將離開本站

並前往http://math.cmu.edu/~ctsourak/kcliquedensest.pdf

A Novel Approach to Finding Near-Cliques: The Triangle ...

Finding the clique number is NP-complete [Kar72]. Further- ... find the densest subgraph on k vertices, is NP-hard [AHI02].

確定！ 回上一頁

查詢 「Find clique」的人也找了：

  1. Find clique
    2.
  2. 3SAT to clique
    3.
  3. Clique problem
    4.
  4. Clique
    5.
  5. Clique C++
    6.
  6. clique演算法
    7.
  7. Clique graph
    8.
  8. N clique
    9.