Community identification algorithm using relative edge density measure
From MaRDI portal
Recommendations
Cited in
(19)- Local community detection based on small cliques
- Discovery of extreme events-related communities in contrasting groups of physical system networks
- Traversing a graph for identifying communities
- Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters
- Defining and identifying cograph communities in complex networks
- Identify implicit communities by graph clustering
- Communities in Large Networks: Identification and Ranking
- Community structure in large complex networks
- Community discovery algorithms: an overview
- IDENTIFICATION OF COMMUNITY STRUCTURE IN NETWORKS USING HIGHER ORDER NEIGHBORHOOD CONCEPTS
- A combinatorial model and algorithm for globally searching community structure in complex networks
- scientific article; zbMATH DE number 2019640 (Why is no real title available?)
- scientific article; zbMATH DE number 2033325 (Why is no real title available?)
- scientific article; zbMATH DE number 2101373 (Why is no real title available?)
- Finding network communities using random walkers with improved accuracy
- Computing Communities in Large Networks Using Random Walks
- Centrality based community discovery
- Remarks on network community properties
- Detection of structurally homogeneous subsets in graphs
This page was built for publication: Community identification algorithm using relative edge density measure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3015617)
