Graph sub-sampling for divide-and-conquer algorithms in large networks
From MaRDI portal
Cites work
- A divide-and-conquer algorithm for core-periphery identification in large networks
- A heuristic approach for dividing graphs into bi-connected components with a size constraint
- A nonparametric view of network models and Newman–Girvan and other modularities
- Community structure in social and biological networks
- Core-periphery structure in networks: a statistical exposition
- Depth-First Search and Linear Graph Algorithms
- Greedy recursive spectral bisection for modularity-bound hierarchical divisive community detection
- scientific article; zbMATH DE number 3942813 (Why is no real title available?)
- scientific article; zbMATH DE number 7646025 (Why is no real title available?)
- Link prediction techniques, applications, and performance: a survey
- Multi-scale attributed node embedding
- Online estimation and community detection of network point processes for event streams
- Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
- Scalable Estimation and Two-Sample Testing for Large Networks via Subsampling
- Sparse networks with core-periphery structure
- Subsampling based community detection for large networks
- Two provably consistent divide-and-conquer clustering algorithms for large networks
This page was built for publication: Graph sub-sampling for divide-and-conquer algorithms in large networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6979107)
