arXiv (OAI Expanded)
open access
Scalable Triangle Counting: The Threshold Algorithm
We study one-pass triangle counting on random-order edge streams. We present a remarkably simple algorithm---read edges from the stream until $Q$ triangles are observed in the prefix, then output $Q\,(m/S)^3$ where $S$ is the stopping length---and prove that, when the maximum number of triangles inc
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
- Scalable Triangle Counting: The Threshold Algorithm#919511
- Optimally pseudorandom $K_4$-free graphs#1116792
- Triangle-Saturated Graphs in the Semi-Random Graph Process#609120
- On asymptotic packing of geometric graphs#1039005
- A Counterexample to Teschner's Bondage-Number Conjecture#927557
Record · ID 1109886
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