Clustering Social Networks
From MaRDI portal
Publication:5458300
DOI10.1007/978-3-540-77004-6_5zbMath1136.91590OpenAlexW1664520935MaRDI QIDQ5458300
Robert Schreiber, Nina Mishra, Isabelle Stanton, Robert Endre Tarjan
Publication date: 11 April 2008
Published in: Algorithms and Models for the Web-Graph (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77004-6_5
Related Items (8)
Equality of opportunity and integration in social networks ⋮ Efficient clustering of large uncertain graphs using neighborhood information ⋮ Clustering in Hypergraphs to Minimize Average Edge Service Time ⋮ Finding Planted Subgraphs with Few Eigenvalues using the Schur--Horn Relaxation ⋮ On the advantage of overlapping clusters for minimizing conductance ⋮ Arbitrary Overlap Constraints in Graph Packing Problems ⋮ A generalized Lieb's theorem and its applications to spectrum estimates for a sum of random matrices ⋮ Unnamed Item
This page was built for publication: Clustering Social Networks
