scientific article; zbMATH DE number 5556003

MaRDI QIDQ3625864zbMATH OpenFDO

Authors Francesc Comellas, Alicia Miralles

Publication date 22 May 2009

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Clustering in the social and behavioral sciences (91C20) Social networks; opinion dynamics (91D30)

Recommendations

• A fast and efficient algorithm to identify clusters in networks
• A local clustering algorithm for connection graphs
• A Local Clustering Algorithm for Connection Graphs
• An automatic clustering algorithm for complex networks based on local agglomeration
• Cluster Identification in Nearest-Neighbor Graphs
• Fast cluster detection in networks by first order optimization
• Experimental and Efficient Algorithms
• A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning

Cited in

(6)

• A Local Clustering Algorithm for Connection Graphs
• Mixing local and global information for community detection in large networks
• Local rewiring algorithms to increase clustering and grow a small world
• Locating highly connected clusters in large networks with hyperloglog counters
• An automatic clustering algorithm for complex networks based on local agglomeration
• A fast and efficient algorithm to identify clusters in networks

This page was built for publication:

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