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.
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… 
2010
2010
This paper describes an approach to evaluating teams of contributors in Wikipedia based on social network analysis. We present… 
2010
2010
The extraction of social groups from social networks existing among employees in the company, its customers or users of various… 
2010
2010
AbstractWe investigate the e ects of heterogeneous and clustered contact patterns onthe timescale and nal size of infectious… 
2009
2009
Transitive trust propagation on webs of trust (social networks representing trust relationships between individuals) is a well… 
2007
2007
For resource discovery in social networks, people can directly contact some acquaintances that have knowledge about the resources… 
2006
2006
Several topology generator algorithms have been proposed to match the heavy-tailed behavior of the real Internet AS-level… 
2005
2005
Recently, there has been significant research activity in the algorithmic analysis of complex networks, such as social networks…