Testing st-Connectivity

Authors:
Sourav Chakraborty;Eldar Fischer;Oded Lachish;Arie Matsliah;Ilan Newman
Affiliations:
Department of Computer Science, University of Chicago, Chicago, IL-60637, USA;Department of Computer Science, Technion, Haifa 3200, Israel;Department of Computer Science, Technion, Haifa 3200, Israel;Department of Computer Science, Technion, Haifa 3200, Israel;Department of Computer Science, University of Haifa, Haifa 31905, Israel
Venue:
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Year:
2007

Citing 10
Cited 6

Self-testing/correcting with applications to numerical problems

Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Property testing and its connection to learning and approximation

Journal of the ACM (JACM)
Robust Characterizations of Polynomials withApplications to Program Testing

SIAM Journal on Computing
Testing Membership in Languages that Have Small Width Branching Programs

SIAM Journal on Computing
Testing the diameter of graphs

Random Structures & Algorithms
Tight Bounds for Testing Bipartiteness in General Graphs

SIAM Journal on Computing
A Characterization of the (natural) Graph Properties Testable with One-Sided Error

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Testing triangle-freeness in general graphs

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A combinatorial characterization of the testable graph properties: it's all about regularity

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Testing Properties of Constraint-Graphs

CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity

Property testing of massively parametrized problems – a survey

Property testing
Property testing of massively parametrized problems – a survey

Property testing
On the query complexity of testing orientations for being Eulerian

ACM Transactions on Algorithms (TALG)
Testing the (s,t)-disconnectivity of graphs and digraphs

Theoretical Computer Science
Testing formula satisfaction

SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
An algebraic characterization of testable boolean CSPs

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

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.