Dynamic graph clustering combining modularity and smoothness
From MaRDI portal
Recommendations
- Graph clustering based on modularity variation estimations
- Dynamic Graph Clustering Using Minimum-Cut Trees
- Dynamic graph clustering using minimum-cut trees
- On Finding Graph Clusterings with Maximum Modularity
- Dynamic Digraph Connectivity Hastens Minimum Sum-of-Diameters Clustering
- Co-clustering of nonsmooth graphons
- Clustering, Visualizing, and Navigating for Large Dynamic Graphs
- Multiple graphs clustering by gradient flow method
- Graph clustering via intra-cluster density maximization
Cited in
(8)- Local community detection in dynamic graphs using personalized centrality
- Dynamic Digraph Connectivity Hastens Minimum Sum-of-Diameters Clustering
- An efficient generator for clustered dynamic random networks
- A near-optimal adaptive algorithm for maximizing modularity in dynamic scale-free networks
- Fully-dynamic hierarchical graph clustering using cut trees
- Dynamic graph clustering using minimum-cut trees
- Dynamic Graph Clustering Using Minimum-Cut Trees
- A novel method for vertex clustering in dynamic networks
This page was built for publication: Dynamic graph clustering combining modularity and smoothness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5178738)
