arXiv (All)
open access
On Estimating Degree Distribution in Streaming and Query Models
Given a graph $G=(V,E)$ with $n$ vertices and $m$ edges, let $C(d)=|\{v\in V:°(v)\ge d\}|$ denote its complementary cumulative degree histogram (CCDH), and let $h$ be the $h$-index of $G$. The goal is to compute a $(\varepsilon_D,\varepsilon_R)$-bi-criteria multiplicative approximation of $C$, where
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
- Avoidability of Digraphs with Height Functions and Orientations of $C_4$#1083811
- Local Clique Covers and Chromatic Number#985390
- Hermite Brings a Laptop: Analyzing Frieze-Jerrum Rounding Yields Improved Approximations for Clustering Problems#1130038
- Improved Sidorenko bound for hypergraph Turan densities#1344767
- Sharp lower bounds for bisections of graphs with bounded maximum degree#1325920
Record · ID 1328309
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