你即將離開本站

並前往http://www.cs.ecu.edu/karl/6420/spr16/Notes/NPcomplete/clique.html

The Clique problem

Suppose that G is an undirected graph. Say that a set S of vertices of G form a clique if each vertex in S is adjacent to each other vertex in S.

確定！ 回上一頁

查詢 「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.