Separating Sublinear Time Computations by Approximate Diameter
From MaRDI portal
Recommendations
Cites work
- Approximating Average Parameters of Graphs
- Approximating the Minimum Spanning Tree Weight in Sublinear Time
- Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time
- Automata, Languages and Programming
- Estimating the weight of metric minimum spanning trees in sublinear-time
- scientific article; zbMATH DE number 1819631 (Why is no real title available?)
- scientific article; zbMATH DE number 1241385 (Why is no real title available?)
- scientific article; zbMATH DE number 1792102 (Why is no real title available?)
- On Sums of Independent Random Variables with Unbounded Variance and Estimating the Average Degree in a Graph
- On testing expansion in bounded-degree graphs
- Property testing and its connection to learning and approximation
- Sublinear Geometric Algorithms
- Sublinear time width-bounded separators and their application to the protein side-chain packing problem
Cited in
(3)
This page was built for publication: Separating Sublinear Time Computations by Approximate Diameter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505645)