A characterization of easily testable induced subgraphs

Combinatorics Probability and Computing

Volumn 15, Issue 6, 2006, Pages 791-805

  Alon, Noga ^a   Shapira, Asaf ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FUNCTIONS; MEASUREMENT ERRORS; NUMBER THEORY; POLYNOMIALS; PROBABILISTIC LOGICS; THEOREM PROVING;

DIRECTED GRAPHS; ONE SIDED ERRORS; PROPERTY TESTER; QUERY COMPLEXITY;

GRAPH THEORY;

EID: 33750309653     PISSN: 09635483     EISSN: 14692163     Source Type: Journal    
DOI: 10.1017/S0963548306007759     Document Type: Article

References (35)

1. Alon, N. (2001) Testing subgraphs in large graphs. In Proc. 42nd IEEE FOCS, IEEE, pp. 434-441.
2. Alon, N., Duke, R. A., Lefmann, H., Rödl, V. and Yuster, R. (1992) The algorithmic aspects of the Regularity Lemma. In Proc. 33rd IEEE FOCS, Pittsburgh, IEEE, pp. 473-481.
3. Also J. Algorithms 16 (1994) 80-109.
4. Alon, N., de la Vega, W. F., Kannan, R. and Karpinski, M. (2002) Random sampling and approximation of MAX-CSP problems. In Proc. 34th ACM STOC, ACM Press, pp. 232-239.
5. Also J. Comput. System Sci. 67 (2003) 212-243.
6. Alon, N., Dar, S., Parnas, M. and Ron, D. (2000) Testing of clustering. In Proc. 41st IEEE FOCS, IEEE, pp. 240-250.
7. Alon, N., Fischer, E., Krivelevich, M. and Szegedy, M. (1999) Efficient testing of large graphs. In Proc. 40th FOCS, New York, IEEE, pp. 656-666.
8. Also Combinatorica 20 (2000) 451-476.
9. Alon, N., Krivelevich, M., Newman, I. and Szegedy, M. (1999) Regular languages are testable with a constant number of queries. In Proc. 40th FOCS, New York, IEEE, pp. 645-655.
10. Also SIAM J. Comput. 30 (2001) 1842-1862.
11. Alon, N. and Krivelevich, M. (2002) Testing k-colorability. SIAM J. Discrete Math. 15 211-227.
12. Alon, N. and Shapira, A. (2002) Testing satisfiability. In Proc. 13th Annual ACM-SIAM SODA, ACM Press, pp. 645-654.
13. Also J. Algorithms 47 (2003) 87-103.
14. Alon, N. and Shapira, A. (2003) Testing subgraphs in directed graphs. In Proc. 35th Annual Symp. on Theory of Computing (STOC), San Diego, California, pp. 700-709.
15. Behrend, F. A. (1946) On sets of integers which contain no three terms in arithmetic progression. In Proc. National Academy of Sciences USA 32 331-332.
16. Bogdanov, A., Obata, K. and Trevisan, L. (2002) A lower bound for testing 3-colorability in bounded-degree graphs. In Proc. 43rd IEEE FOCS, IEEE, pp. 93-102.
17. Corneil, D. G., Lerchs, H. and Stewart Burlingham, L. (1981) Complement reducible graphs. Discrete Appl. Math. 3 163-174.
18. Corneil, D. G., Perl, Y. and Stewart, L. K. (1985) A linear recognition algorithm for cographs. SIAM J. Comput. 14 926-934.
19. Czumaj, A. and Sohler, C. (2000) Property testing in computational geometry. In Proc. 8th Annual European Symposium on Algorithms, pp. 155-166.
20. Czumaj, A. and Sohler, C. (2001) Testing hypergraph coloring. In Proc. ICALP, pp. 493-505.
21. Erdos, P., Frankl, P. and Rödl, V. (1986) The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent. Graphs Combin. 2 113-121.
22. Fischer, E. (2001) The art of uninformed decisions: A primer to property testing. Bull. Eur. Assoc. Theor. Comput. Sci. (Computational Complexity column) 75 97-126.
23. Fischer, E., Kindler, G., Ron, D., Safra, S. and Samorodnitsky, A. (2002) Testing juntas. In Proc. 43rd FOCS, pp. 103-112.
24. Fischer, E., Lehman, E., Newman, I., Raskhodnikova, S., Rubinfeld, R. and Samorodnitsky, A. (2002) Monotonicity testing over general poset domains. In Proc. 34th STOC, pp. 474-483.
25. Frieze, A. and Kannan, R. (1999) Quick approximation to matrices and applications. Combinatorica 19 175-220.
26. Goldreich, O. (1998) Combinatorial property testing: A survey. In Randomization Methods in Algorithm Design (P. Pardalos, S. Rajasekaran and J. Rolim, eds), AMS-DIMACS, pp. 45-60.
27. Goldreich, O., Goldwasser, S. and Ron, D. (1996) Property testing and its connection to learning and approximation. In Proc. 37th Annual IEEE FOCS, pp. 339-348.
28. Also J. Assoc. Comput. Mach. 45 (1998) 653-750.
29. Goldreich, O. and Trevisan, L. (2001) Three theorems regarding testing graph properties. In Proc. 42nd IEEE FOCS, IEEE, pp. 460-469.
30. Graham, R. L., Rothschild, B. L. and Spencer, J. H. (1990) Ramsey Theory, 2nd edn, Wiley, New York.
31. McKee, T. A. and McMorris, F. R. (1999) Topics in Intersection Graph Theory, SIAM, Philadelphia, PA.
32. Ron, D. (2001) Property testing. In Handbook of Randomized Computing, Vol. II (P. M. Pardalos, S. Rajasekaran, J. Reif and J. D. P. Rolim, eds), Kluwer Academic Publishers, pp. 597-649.
33. Rubinfeld, R. and Sudan, M. (1996) Robust characterization of polynomials with applications to program testing. SIAM J. Comput. 25 252-271.
34. Szemerédi, E. (1978) Regular partitions of graphs. In Proc. Colloque Inter. CNRS (J. C. Bermond, J. C. Fournier, M. Las Vergnas and D. Sotteau, eds), pp. 399-401.
35. Yao, A. C. (1977) Probabilistic computation, towards a unified measure of complexity. In Proc. 18th IEEE FOCS, pp. 222-227.