Erasure-resilient sublinear-time graph algorithms
From MaRDI portal
Cites work
- L_p-testing
- A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling
- Approximately counting triangles in sublinear time
- Approximating average parameters of graphs
- Approximating the distance to monotonicity of Boolean functions
- Approximating the Minimum Spanning Tree Weight in Sublinear Time
- Counting stars and other small subgraphs in sublinear-time
- Erasure-Resilient Property Testing
- Erasures vs. errors in local decoding and property testing
- Estimating the number of connected components in sublinear time
- scientific article; zbMATH DE number 7204459 (Why is no real title available?)
- scientific article; zbMATH DE number 7650357 (Why is no real title available?)
- Introduction to Property Testing
- Lower bounds for approximating graph parameters via communication complexity
- 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
- Property testing and its connection to learning and approximation
- Property testing in bounded degree graphs
- Sublinear-time algorithms for counting star subgraphs via edge sampling
- Testing the diameter of graphs
- Tight Bounds for Testing Bipartiteness in General Graphs
- Tolerant property testing and distance approximation
This page was built for publication: Erasure-resilient sublinear-time graph algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229369)
