scientific article; zbMATH DE number 7204459
From MaRDI portal
Publication:5111336
DOI10.4230/LIPICS.ICALP.2017.7zbMATH Open1441.68174MaRDI QIDQ5111336FDOQ5111336
Authors: Talya Eden, Dana Ron, C. Seshadhri 
Publication date: 27 May 2020
Title of this publication is not available (Why is that?)
Recommendations
- Sublinear time estimation of degree distribution moments: the arboricity connection
- Counting stars and other small subgraphs in sublinear time
- Counting stars and other small subgraphs in sublinear-time
- On sums of independent random variables with unbounded variance, and estimating the average degree in a graph
- Approximately counting triangles in sublinear time
Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Analysis of algorithms (68W40) Vertex degrees (05C07)
Cited In (8)
- Title not available (Why is that?)
- Quantum Chebyshev's Inequality and Applications
- Sublinear time estimation of degree distribution moments: the arboricity connection
- A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling
- Lower bounds for approximating graph parameters via communication complexity
- Efficient estimation algorithms for neighborhood variance and other moments
- On approximating the number of \(k\)-cliques in sublinear time
- On sums of independent random variables with unbounded variance, and estimating the average degree in a graph
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111336)
