Algorithm for detecting overlapping communities from complex network big data
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 7109096
- Uncovering the overlapping community structure of complex networks by maximal cliques
- Research of overlapping community detection algorithm based on time-weighted
- Detecting community structure via the maximal sub-graphs and belonging degrees in complex networks
- A graph compression based overlapping communities detection algorithm
Cited in
(7)- 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 graph compression based overlapping communities detection algorithm
- Research of overlapping community detection algorithm based on time-weighted
- A community detection algorithm based on cover
- scientific article; zbMATH DE number 7109096 (Why is no real title available?)
- A new overlapping community detection algorithm based on similarity of neighbors in complex networks
This page was built for publication: Algorithm for detecting overlapping communities from complex network big data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5368639)