Community detection by using the extended modularity
From MaRDI portal
Recommendations
- Detecting network communities: a new systematic and efficient algorithm
- Detecting community structure via the maximal sub-graphs and belonging degrees in complex networks
- Detecting overlapping communities in networks using the maximal sub-graph and the clustering coefficient
- Uncovering the overlapping community structure of complex networks by maximal cliques
- A modularity degree based heuristic community detection algorithm
Cited in
(11)- Complete graph model for community detection
- A greedy algorithm for neighborhood overlap-based community detection
- Detecting overlapping communities in networks using the maximal sub-graph and the clustering coefficient
- Detecting community structure via the maximal sub-graphs and belonging degrees in complex networks
- A modularity-maximization-based approach for detecting multi-communities in social networks
- Communities and their role in small world graphs
- A Hypothesis Testing Framework for Modularity Based Network Community Detection
- Traversing a graph for identifying communities
- Community detection based on neighborhood information
- Network community detection using modularity density measures
- Modularity based community detection in hypergraphs
This page was built for publication: Community detection by using the extended modularity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3106206)