Assertion: k clique | /r/HasProperty | complete subgraph
Facets:
value: on a network with directed links
type: OTHER
value: with k
type: OTHER
Source sentences:
text: On a network with directed links a directed k-clique is a complete subgraph with k nodes fulfilling the following condition.
text: On a network with weighted links a weighted k-clique is a complete subgraph with k nodes such that the geometric mean of the k (k - 1) / 2 link weights within the k-clique is greater than a selected threshold value, I. The weighted Clique Percolation Method defines weighted network communities as the percolation clusters of weighted k-cliques.