你即將離開本站

並前往http://www2.cs.uidaho.edu/~tsoule/oldcs472/MaxClique.html

CS472/572 Max Clique

Given an undirected graph G = (V,E) where V is the set of vertices of the graph and E is the set of edges. A clique is a set of mutually adjacent vertices.

確定！ 回上一頁

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