Pages that link to "Item:Q3580951"
From MaRDI portal
The following pages link to On sums of independent random variables with unbounded variance, and estimating the average degree in a graph (Q3580951):
Displaying 6 items.
- Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms (Q995573) (← links)
- A sublinear-time approximation scheme for bin packing (Q1034628) (← links)
- Comparing node degrees in probabilistic networks (Q4958787) (← links)
- Edge-statistics on large graphs (Q4993086) (← links)
- A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling (Q5090376) (← links)
- Sublinear time estimation of degree distribution moments: the degeneracy connection (Q5111336) (← links)