arXiv (All)
open access
Single-Pass Estimation of the Clustering Coefficient Distribution in Graph Streams
Triangle counting is one of the most fundamental problems in network analysis. Given the massive sizes of real-world graphs, there is a long history of small-space streaming algorithms providing accurate estimates for this problem. However, most of the results focus on estimating the total triangle
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
- Resolvable 3-star designs#955113
- Fully Inductive Cardinality Estimation#414115
- VISPEK: a Visual Interactive System for Progressive Ensemble K-Means Clustering#449026
- Learning to Cluster for Rendering with Many Lights#476354
- Evaluation of MTego and BG-Sentinel traps for malaria and arbovirus vector surveillance in Cabo Verde#465484
Record · ID 1049228
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