Abstract
We study the power of four query models in the context of property testing in general graphs, where our main case study is the problem of testing k-colorability. Two query types, which have been studied extensively in the past, are pair queries and neighbor queries. The former corresponds to asking whether there is an edge between any particular pair of vertices, and the latter to asking for the i th neighbor of a particular vertex. We show that while for pair queries testing k-colorability requires a number of queries that is a monotone decreasing function in the average degree d, the query complexity in the case of neighbor queries remains roughly the same for every density and for large values of k. We also consider a combined model that allows both types of queries, and we propose a new, stronger, query model, related to the field of Group Testing. We give upper and lower bounds on the query complexity for one-sided error in all the models, where the bounds are nearly tight for three of the models. In some of the cases, our lower bounds extend to two-sided error algorithms.
The problem of testing k-colorability was previously studied in the contexts of dense graphs and of sparse graphs, and in our proofs we unify approaches from those cases, and also provide some new tools and techniques that may be of independent interest.
Similar content being viewed by others
References
Alon N., Fischer E., Krivelevich M., Szegedy M. (2000) Efficient Testing of Large Graphs. Combinatorica 20: 451–476
N. Alon, E. Fischer, I. Newman & A. Shapira (2007). A combinatorial characterization of the testable graph properties: it’s all about regularity. In Proceedings of the 38th ACM STOC, 251–260.
N. Alon, T. Kaufman, M. Krivelevich & D. Ron (2006). Testing triangle freeness in general graphs. In Proceedings of the 17th ACM-SIAM SODA, 279–288.
Alon N., Krivelevich M. (2002) Testing k-colorability. SIAM Journal on Discrete Math 15(2): 211–227
N. Alon & J. Spencer (2000). The probabilistic method. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience, New York.
A. Bogdanov, K. Obata & L. Trevisan (2002). A lower bound for testing 3-colorability in bounded degree graphs. In Proceedings of the 43th IEEE FOCS, 93–102.
B. Bollobás (2001). Random Graphs. Cambridge University Press. 2nd edition.
A. Czumaj, A. Shapira & C. Sohler (2009). Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs. SIAM Journal on Computing 38(6), 2499–2510. This is a journal version of Czumaj Sohler (2007).
A. Czumaj & C. Sohler (2007). On testable properties in bounded degree graphs. In Proceedings of the 18th ACM-SIAM SODA, 494–501.
D. Du & F. Hwang (1993). Combinatorial group testing and its applications. World Scientific.
Erdös P. (1962) On circuits and subgraphs of chromatic graphs. Mathematika 9: 170–175
Feige U. (2006) On sums of independent random variables with unbounded variance, and estimating the average degree in a graph. SIAM Journal on Computing 35(4): 964–984
Goldreich O., Goldwasser S., Ron D. (1998) Property Testing and its Connection to Learning and Approximation. JACM 45(4): 653–750
Goldreich O., Ron D. (1999) A Sublinear Bipartite Tester for Bounded Degree Graphs. Combinatorica 19(3): 335–373
Goldreich O., Ron D. (2002) Property Testing in Bounded Degree Graphs. Algorithmica 32(2): 302–343
Goldreich O., Ron D. (2008) Approximating average parameters of graphs. Random Structures and Algorithms 32(4): 473–493
Kaufman T., Krivelevich M., Ron D. (2004) Tight Bounds for Testing Bipartiteness in General Graphs. SIAM Journal on Computing 33(6): 1441–1483
R. Motwani & P. Raghavan (1995). Randomized algorithms. Cambridge University Press.
Ordentlich E., Roth R.M. (2000) Two-dimensional weight-constrained codes through enumeration bounds. IEEE Trans. Inf. Theory 46: 1292–1301
Parnas M., Ron D. (2002) Testing the Diameter of Graphs. Random Structures and Algorithms 20(2): 165–183
Rödl V., Duke R.A. (1985) On graphs with small subgraphs of large chromatic number. Graphs Combin 1: 91–96
Rubinfeld R., Sudan M. (1996) Robust Characterization of Polynomials with Applications to Program Testing. SIAM Journal on Computing 25(2): 252–271
D.B. West (2000). Introduction to Graph Theory. Prentice Hall.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ben-Eliezer, I., Kaufman, T., Krivelevich, M. et al. Comparing the strength of query types in property testing: The case of k-colorability. comput. complex. 22, 89–135 (2013). https://doi.org/10.1007/s00037-012-0048-2
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00037-012-0048-2