Finding strongly knit clusters in social networks

DOI10.1080/15427951.2008.10129299zbMATH Open1206.68051OpenAlexW1966347128MaRDI QIDQ3078604FDOQ3078604

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

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

Mathematics Subject Classification ID

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

Cited In (4)

• Finding endogenously formed communities
• Clustering Social Networks
• Finding disjoint dense clubs in a social network
• Title not available (Why is that?)

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)