Parallel community detection for massive graphs
From MaRDI portal
Graph algorithms (graph-theoretic aspects) (05C85) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Data structures (68P05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Recommendations
- Exhaustive community enumeration in parallel
- Parallel maximum clique algorithms with applications to network analysis
- A parallel maximum clique algorithm for large and massive sparse graphs
- Fast multi-scale detection of overlapping communities using local criteria
- scientific article; zbMATH DE number 7109096
Cited in
(9)- Local community detection in dynamic graphs using personalized centrality
- Efficient approximation algorithms for weighted b-matching
- Exhaustive community enumeration in parallel
- Fast multi-scale detection of overlapping communities using local criteria
- A parallel computing hierarchical community approach based on weighted-graph
- scientific article; zbMATH DE number 7109096 (Why is no real title available?)
- Graph coarsening and clustering on the GPU
- Massively Parallel Correlation Clustering in Bounded Arboricity Graphs
- Computing the edge expansion of a graph using semidefinite programming
This page was built for publication: Parallel community detection for massive graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5298945)
