Approximating Average Parameters of Graphs
From MaRDI portal
Recommendations
Cited in
(14)- A sublinear-time approximation scheme for bin packing
- Sublinear graph augmentation for fast query implementation
- Approximating average parameters of graphs
- On sums of independent random variables with unbounded variance, and estimating the average degree in a graph
- Sublinear time estimation of degree distribution moments: the arboricity connection
- An averaging process on hypergraphs
- Average distance queries through weighted samples in graphs and metric spaces: high scalability with tight statistical guarantees
- Separating Sublinear Time Computations by Approximate Diameter
- Erasure-resilient sublinear-time graph algorithms
- Sublinear time approximation schemes for makespan minimization on parallel machines
- Sublinear algorithms for scheduling with chain precedence constraints
- Better sum estimation via weighted sampling
- Separating sublinear time computations by approximate diameter
- Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
This page was built for publication: Approximating Average Parameters of Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3595407)