Finding strongly knit clusters in social networks

DOI10.1080/15427951.2008.10129299MaRDI QIDQ3078604zbMATH OpenOpenAlexFDO

Authors Nina Mishra, Robert Schreiber, Isabelle Stanton, Robert E. Tarjan

Publication date 28 February 2011

Published in Internet Mathematics (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/euclid.im/1259158602

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Social networks; opinion dynamics (91D30) Internet topics (68M11)

Recommendations

• Clustering Social Networks
• Finding endogenously formed communities
• On the complexity of Newman's community finding approach for biological and social networks
• Community discovery algorithms: an overview
• A fast and efficient algorithm to identify clusters in networks

Cited in

(4)

• scientific article; zbMATH DE number 6831226 (Why is no real title available?)
• Finding endogenously formed communities
• Finding disjoint dense clubs in a social network
• Clustering Social Networks

This page was built for publication: Finding strongly knit clusters in social networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3078604)