你即將離開本站

並前往https://dl.acm.org/doi/10.1145/990524.990529

A clique problem equivalent to graph isomorphism - ACM ...

A class of graphs called M-graphs is defined. It is shown thati) the problem of determining whether a given M-graph of order n2 has a clique of order n is ...

確定！ 回上一頁

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