翻訳と辞書 |
clique A {maximal} {totally connected} {subgraph}. Given a graph with nodes N, a clique C is a {subset} of N where every node in C is directly connected to every other node in C (i.e. C is totally connected), and C contains all such nodes (C is maximal). In other words, a clique contains all, and only, those nodes which are directly connected to all other nodes in the clique. [Is this correct?] (1996-09-22)
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|