Skip to main content
SpringerLink
Log in

On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs

  • Published:
computational complexity Aims and scope Submit manuscript

Abstract

We study property testing of (di)graph properties in bounded-degree graph models. The study of graph properties in bounded-degree models is one of the focal directions of research in property testing in the last 15 years. However, despite the many results and the extensive research effort, there is no characterization of the properties that are strongly testable (i.e. testable with constant query complexity) even for 1-sided error tests.

The bounded-degree model can naturally be generalized to directed graphs resulting in two models that were considered in the literature. The first contains the directed graphs in which the out-degree is bounded but the in-degree is not restricted. In the other, both the out-degree and in-degree are bounded.

We give a characterization of the 1-sided error strongly testable monotone graph properties and the 1-sided error strongly testable hereditary graph properties in all the bounded-degree directed and undirected graphs models.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Noga Alon, Eldar Fischer, Ilan Newman & Asaf Shapira (2009). A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity. SIAM J. Comput.39(1), 143–167. URL http://dx.doi.org/10.1137/060667177

  • Noga Alon & Asaf Shapira (2006). A Characterization of Easily Testable Induced Subgraphs. Combinatorics, Probability & Computing15(6), 791–805. URL http://dx.doi.org/10.1017/S0963548306007759

  • Noga Alon & Asaf Shapira (2008). A Characterization of the (Natural) Graph Properties Testable with One-Sided Error. SIAM J. Comput.37(6), 1703–1727. URL http://dx.doi.org/10.1137/06064888X

  • Michael A. Bender & Dana Ron (2002). Testing properties of directed graphs: acyclicity and connectivity. Random Struct. Algorithms20(2), 184–205. URL http://dx.doi.org/10.1002/rsa.10023

  • Czumaj, Artur, Goldreich, Oded, Dana Ron, C., Seshadhri, Asaf Shapira, Sohler, Christian: Finding cycles and trees in sublinear time. Random Struct. Algorithms 45(2), 139–184 (2014)

    Article  MathSciNet  Google Scholar 

  • Artur Czumaj, Pan Peng & Christian Sohler (2015). Testing Cluster Structure of Graphs. In Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, Portland, OR, USA, STOC '15, 723–732

  • Artur Czumaj, Pan Peng & Christian Sohler (2016). Relating Two Property Testing Models for Bounded Degree Directed Graphs. In Proceedings of the Forty-eighth Annual ACM Symposium on Theory of Computing, STOC '16, 1033-1045. ISBN 978-1-4503-4132-5. URL http://doi.acm.org/10.1145/2897518.2897575

  • Artur Czumaj, Asaf Shapira & Christian Sohler (2009). Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs. SIAM J. Comput.38(6), 2499–2510. URL http://dx.doi.org/10.1137/070681831

  • Artur Czumaj & Christian Sohler (2010). Testing Expansion in Bounded-Degree Graphs. Combinatorics, Probability & Computing19(5-6), 693–709. URL http://dx.doi.org/10.1017/S096354831000012X

  • Oded Goldreich, Shafi Goldwasser & Dana Ron (1998). Property Testing and its Connection to Learning and Approximation. J. ACM45(4), 653–750. URL http://doi.acm.org/10.1145/285055.285060

  • Oded Goldreich & Dana Ron: A Sublinear Bipartiteness Tester for Bounded Degree Graphs. Combinatorica 19(3), 335–373 (1999)

    Article  MathSciNet  Google Scholar 

  • Oded Goldreich & Dana Ron (2002). Property Testing in Bounded Degree Graphs. Algorithmica32(2), 302–343. URL http://dx.doi.org/10.1007/s00453-001-0078-7

  • Oded Goldreich & Dana Ron: On Proximity-Oblivious Testing. SIAM J. Comput. 40(2), 534–566 (2011a)

    Article  MathSciNet  Google Scholar 

  • Oded Goldreich & Dana Ron (2011b). On Testing Expansion in Bounded-Degree Graphs. In Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation, 68-75. URL https://doi.org/10.1007/978-3-642-22670-0_9

  • Oded Goldreich & Luca Trevisan (2003). Three theorems regarding testing graph properties. Random Struct. Algorithms23(1), 23–57. URL https://doi.org/10.1002/rsa.10078

  • Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguyen & Krzysztof Onak (2009). Local Graph Partitions for Approximation and Testing. In 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA, 22–31.

  • Hiro Ito, Areej Khoury & Ilan Newman (2019). On the Characterization of \(1\)-sided error Strongly Testable Graph Properties for bounded-degree graphs, including an appendix, arxive cs.CC 1909.09984

  • Reut Levi & Dana Ron (2015). A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor. ACM Trans. Algorithms11(3), 24:1–24:13. URL http://doi.acm.org/10.1145/2629508

  • Asaf Nachmias & Asaf Shapira (2010). Testing the expansion of a graph. Inf. Comput.208(4), 309–314. URL https://doi.org/10.1016/j.ic.2009.09.002

  • Ilan Newman & Christian Sohler (2013). Every Property of Hyperfinite Graphs Is Testable. SIAM J. Comput.42(3), 1095–1112. URL http://dx.doi.org/10.1137/120890946

  • Huy N. Nguyen & Krzysztof Onak (2008). Constant-Time Approximation Algorithms via Local Improvements. In 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA, 327–336.

  • Yaron Orenstein & Dana Ron (2011). Testing Eulerianity and connectivity in directed sparse graphs. Theor. Comput. Sci.412(45), 6390–6408. URL http://dx.doi.org/10.1016/j.tcs.2011.06.038

  • Michal Parnas & Dana Ron (2002). Testing the diameter of graphs. Random Struct. Algorithms20(2), 165–183. URL http://dx.doi.org/10.1002/rsa.10013

  • Yuichi Yoshida & Hiro Ito (2010). Testing k-edge-connectivity of digraphs. J. Systems Science & Complexity 23(1), 91–101. URL http://dx.doi.org/10.1007/s11424-010-9280-5.

Download references

Acknowledgements

We thank Oded Goldreich for the extensive work he has done in order to improve the presentation of this paper.

The third author is supported by The Israel Science Foundation, grant number 497/17.

Author information

Authors and Affiliations

  1. School of Informatics and Engineering, University of Electro-Communications and Crest, JST, Chofu, Japan

    Hiro Ito

  2. Department of Computer Science, University of Haifa, Haifa, Israel

    Areej Khoury & Ilan Newman

Authors
  1. Hiro Ito
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Areej Khoury
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ilan Newman
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ilan Newman.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ito, H., Khoury, A. & Newman, I. On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs. comput. complex. 29, 1 (2020). https://doi.org/10.1007/s00037-019-00191-6

Download citation

  • Received:

  • Published:

  • DOI: https://doi.org/10.1007/s00037-019-00191-6

Keywords

Subject classification

Search

Navigation