Abstract
We continue the study, started in [9], of property testing of graphs in the orientation model. A major question which was left open in [9] is whether the property of st-connectivity can be tested with a constant number of queries. Here we answer this question on the affirmative. To this end we construct a non-trivial reduction of the st-connectivity problem to the problem of testing languages that are decidable by branching programs, which was solved in [11]. The reduction combines combinatorial arguments with a concentration type lemma that is proven for this purpose. Unlike many other property testing results, here the resulting testing algorithm is highly non-trivial itself, and not only its analysis.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alon, N., Fischer, E., Newman, I., Shapira, A.: A Combinatorial Characterization of the Testable Graph Properties: It’s All About Regularity. In: Proceedings of the 38th ACM STOC, pp. 251–260. ACM, New York (2006)
Alon, N., Kaufman, T., Krivilevich, M., Ron, D.: Testing triangle-freeness in general graphs. In: Proceedings of the 17th SODA, pp. 279–288 (2006)
Alon, N., Shapira, A.: A Characterization of the (natural) Graph Properties Testable with One-Sided Error. In: Proceedings of the 46th IEEE FOCS, pp. 429–438 (2005) Also SIAM Journal on Computing (to appear)
Blum, M., Luby, M., Rubinfeld, R.: Self-testing/correcting with applications to numerical problems. Journal of Computer and System Sciences 47, 549–595 (1993) (a preliminary version appeared in Proc. 22nd STOC, 1990).
Fischer, E.: The art of uninformed decisions: A primer to property testing. In: Paun, G., Rozenberg, G., Salomaa, A. (eds.) Current Trends in Theoretical Computer Science: The Challenge of the New Century, vol. I, pp. 229–264. World Scientific Publishing (2004)
Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. JACM 45(4), 653–750 (1998)
Goldreich, O., Ron, D.: Property testing in bounded degree graphs. Algorithmica 32(2), 302–343 (2002)
Halevy, S., Lachish, O., Newman, I., Tsur, D.: Testing Properties of Constraint-Graphs. In: Halevy, S., Lachish, O., Newman, I., Tsur, D. (eds.) Proceedings of the 22nd IEEE Annual Conference on Computational Complexity (CCC 2007) (to appear)
Halevy, S., Lachish, O., Newman, I., Tsur, D.: Testing Orientation Properties. In: Electronic Colloquium on Computational Complexity (ECCC) (2005)
Kaufman, T., Krivelevich, M., Ron, D.: Tight bounds for testing bipartiteness in general graphs. SICOMP 33(6), 1441–1483 (2004)
Newman, I.: Testing Membership in Languages that Have Small Width Branching Programs. SIAM Journal on Computing 31(5), 1557–1570 (2002)
Parnas, M., Ron, D.: Testing the diameter of graphs. Random Structures and Algorithms 20(2), 165–183 (2002)
Ron, D.: Property testing (a tutorial). In: Pardalos, P.M., Reif, J.H., Rolim, J.D.P. (eds.) Handbook of Randomized Computing, vol. II, ch. 15, Kluwer Press, Dordrecht (2001)
Rubinfeld, R., Sudan, M.: Robust characterization of polynomials with applications to program testing. SIAM Journal on Computing 25, 252–271 (1996) (first appeared as a technical report, Cornell University, 1993).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chakraborty, S., Fischer, E., Lachish, O., Matsliah, A., Newman, I. (2007). Testing st-Connectivity. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. APPROX RANDOM 2007 2007. Lecture Notes in Computer Science, vol 4627. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74208-1_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-74208-1_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74207-4
Online ISBN: 978-3-540-74208-1
eBook Packages: Computer ScienceComputer Science (R0)