Skip to search formSkip to main contentSkip to account menu

Clustering coefficient

Known as: Clustering 
In graph theory, a clustering coefficient is a measure of the degree to which nodes in a graph tend to cluster together. Evidence suggests that in… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Level set methods have been widely used in image processing specially in image segmentation. This paper presents a new region… 
2012
2012
  • M. MirG. T. Tabrizi
  • 2012
  • Corpus ID: 8610671
Intelligent algorithms have always been used as a global search method in many optimization problems. One of these problems is… 
2011
2011
We present Net EvViz, a visualization tool for analysis and exploration of a dynamic social network. There are plenty of visual… 
2011
2011
This paper studies the effect of linguistic constraints on the large scale organization of language. It describes the properties… 
2009
2009
Transitive trust propagation on webs of trust (social networks representing trust relationships between individuals) is a well… 
2007
2007
In this paper, the investigation is first motivated by showing two examples of simple regular symmetrical graphs, which have the… 
2003
2003
We present a local, scalable, and fault-tolerant distributed clustering service, LOCI, that partitions a multi-hop wireless…