The k-Dense Method to Extract Communities from Complex Networks
From MaRDI portal
Recommendations
- Community detection in dense random networks
- A density set algorithm for searching communities in complex networks
- Network community detection using modularity density measures
- Fast community detection in complex networks with a \(K\)-depths classifier
- Finding community structure in networks using a shortest-path-based k-means algorithm
- Community detection in sparse random networks
Cites work
- A New Algorithm for Generating All the Maximal Independent Sets
- An algorithm for drawing general undirected graphs
- An exact algorithm for the maximum clique problem
- Community structure in social and biological networks
- Fast algorithms for determining (generalized) core groups in social networks
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Network analysis. Methodological foundations.
- The Structure and Function of Complex Networks
Cited in
(5)- Network refinement: denoising complex networks for better community detection
- A community extraction algorithm for large-scale online social networks
- Locating highly connected clusters in large networks with hyperloglog counters
- Extracting the Core Structure of Social Networks Using (α, β)-Communities
- Finding weighted k-truss communities in large networks
This page was built for publication: The k-Dense Method to Extract Communities from Complex Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3627917)
