arXiv (All)
open access
Arboricity Matters in Triangle Counting with Random Edges
Given a simple, unweighted, undirected graph $G=(V,E)$ with $|V|=n$ and $|E|=m$, and parameters $0 < \varepsilon, δ<1$, along with Degree, Neighbour, Pair and RandomEdge query access to $G$, we provide a query-based randomized algorithm to generate an estimate $\widehat{T}$ of the number of 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
- Tolerant Testers for Subgraph-Freeness#1355802
- Identifying open codes in trees and 4-cycle-free graphs of given maximum degree#1186299
- Wait-free trees with asymptotically-efficient range queries#1251617
- GraphK: Variable-Size Graph Generation with Efficient Edge Construction#467152
- M 1.0 - 36 km SE of Malaga, New Mexico#1160148
Record · ID 1328274
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