arXiv (All)
open access
Introvert Clustering for Distributed Graph Algorithms
We introduce a graph decomposition primitive called introvert clustering, which strengthens standard low-diameter clustering by guaranteeing that every clustered vertex keeps at least a $\left(\frac12-\varepsilon\right)$-fraction of its relevant neighbors in its own cluster. Repeatedly applying this
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System#394373
- NOMAD: Generating Embeddings for Massive Distributed Graphs#5934
- Graph Anomaly Detection as Finite-Horizon Control: Training-Free Scoring via Empirical Bayes#1143025
- Tight Distance Query Reconstruction for Trees and Graphs Without Long Induced Cycles#923083
- Clustered Edge Intelligence: Beyond Just Convergence of Edge Computing and AI#394372
Record · ID 996842
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive