Testing connectedness of images

DOI10.1007/S00453-024-01248-XMaRDI QIDQ6623596zbMATH OpenFDO

Authors Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova, Dragos-Florian Ristache

Publication date 24 October 2024

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00453-024-01248-X

zbMATH Keywords

computational geometryproperty testingsublinear algorithms

Mathematics Subject Classification ID

Graph theory (05Cxx) Algorithms in computer science (68Wxx)

Cites work

• L_p-testing
• Approximate testing of visual properties
• Approximating the Minimum Spanning Tree Weight in Sublinear Time
• Deleting and Testing Forbidden Patterns in Multi-Dimensional Arrays
• Earthmover Resilience and Testing in Ordered Structures
• Erasure-resilient sublinear-time graph algorithms
• Estimating the number of connected components in sublinear time
• Property testing and its connection to learning and approximation
• Property testing in bounded degree graphs
• Robust Characterizations of Polynomials with Applications to Program Testing
• Testing convexity of figures under the uniform distribution
• Testing of matrix-poset properties
• Testing Properties of Sparse Images
• Testing the diameter of graphs
• The power and limitations of uniform samples in testing properties of figures
• 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)