「-k」の共起表現一覧(1語右が「vertices」)
該当件数 : 6件
| aph remains connected when you delete fewer than | k vertices from the graph. |
| ed graph is a graph in which removing fewer than | k vertices always leaves the remaining graph conne |
| exist a hash function in F that colors any given | k vertices with k distinct colors. |
| between two of its induced subgraphs of at most | k vertices can be extended to an automorphism of t |
| In graph theory this means finding a set of | k vertices for which the largest distance of any p |
| ring of the configuration; a configuration with | k vertices in its ring is a k-ring configuration, |
こんにちは ゲスト さん
ログイン |
Weblio会員(無料)になると
|
検索履歴を保存できる！
こんにちは ゲスト さん
|
ログイン |
Weblio会員(無料)になると
|
