Testing connectedness of images
From MaRDI portal
Publication:6623596
DOI10.1007/S00453-024-01248-XMaRDI QIDQ6623596FDOQ6623596
Piotr Berman, Dragos-Florian Ristache, Sofya Raskhodnikova, Meiram Murzabulatov
Publication date: 24 October 2024
Published in: Algorithmica (Search for Journal in Brave)
Cites Work
- Property testing and its connection to learning and approximation
- Property testing in bounded degree graphs
- Robust Characterizations of Polynomials with Applications to Program Testing
- L p -testing
- Approximating the Minimum Spanning Tree Weight in Sublinear Time
- Testing the diameter of graphs
- Testing Properties of Sparse Images
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- The power and limitations of uniform samples in testing properties of figures
- Estimating the number of connected components in sublinear time
- Testing of matrix-poset properties
- Deleting and Testing Forbidden Patterns in Multi-Dimensional Arrays
- Earthmover Resilience and Testing in Ordered Structures
- Testing convexity of figures under the uniform distribution
- Erasure-Resilient Sublinear-Time Graph Algorithms
- Tolerant Testers of Image Properties
This page was built for publication: Testing connectedness of images
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6623596)
