Testing subgraphs in directed graphs

Journal of Computer and System Sciences

Volumn 69, Issue 3 SPEC. ISS., 2004, Pages 354-382

  Alon, Noga ^a   Shapira, Asaf ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Core; Directed graphs; Property testing; Regularity

Indexed keywords

COMPUTATIONAL COMPLEXITY; ERROR ANALYSIS; FUNCTION EVALUATION; NUMBER THEORY; POLYNOMIALS; PROBABILITY; SET THEORY; TREES (MATHEMATICS);

CORE; DIRECTED GRAPH; PROPERTY TESTING; REGULARITY LEMMA;

GRAPH THEORY;

EID: 4544293969     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jcss.2004.04.008     Document Type: Conference Paper

References (39)

1. N. Alon, Testing subgraphs in large graphs, Proceedings of the 42nd IEEE FOCS, IEEE, New York, 2001, pp. 434-441.
2. N. Alon, S. Dar, M. Parnas, D. Ron, Testing of clustering, Proceedings of the 41st IEEE FOCS, IEEE, New York, 2000, pp. 240-250.
3. N. Alon, W.F. de la Vega, R. Kannan, M. Karpinski, Random sampling and approximation of MAX-CSP problems, Proceedings of the 34th ACM STOC, ACM Press, New York, 2002, pp. 232-239.
4. N. Alon, R.A. Duke, H. Lefmann, V. Rödl, R. Yuster, The algorithmic aspects of the Regularity Lemma, Proceedings of the 33rd IEEE FOCS, Pittsburgh, IEEE, New York, 1992, pp. 473-481. Alon N., Duke R.A., Lefmann H., Rödl V., Yuster R. Algorithms. 16:1994;80-109.
5. N. Alon, R.A. Duke, H. Lefmann, V. Rödl, R. Yuster, The algorithmic aspects of the Regularity Lemma, Proceedings of the 33rd IEEE FOCS, Pittsburgh, IEEE, New York, 1992, pp. 473-481. Alon N., Duke R.A., Lefmann H., Rödl V., Yuster R. Algorithms. 16:1994;80-109.
6. N. Alon, E. Fischer, M. Krivelevich, M. Szegedy, Efficient testing of large graphs, Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS), IEEE, New York, 1999, pp. 656-666. Alon N., Fischer E., Krivelevich M., Szegedy M. Combinatorica. 20:2000;451-476.
7. N. Alon, E. Fischer, M. Krivelevich, M. Szegedy, Efficient testing of large graphs, Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS), IEEE, New York, 1999, pp. 656-666. Alon N., Fischer E., Krivelevich M., Szegedy M. Combinatorica. 20:2000;451-476.
8. Alon N., Krivelevich M. Testing. k -colorability SIAM J. Discrete Math. 15:2002;211-227.
9. N. Alon, M. Krivelevich, I. Newman, M. Szegedy, Regular languages are testable with a constant number of queries, Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS), IEEE, New York, 1999, pp. 645-655. Alon N., Krivelevich M., Newman I., Szegedy M. SIAM J. Comput. 30:2001;1842-1862.
10. N. Alon, M. Krivelevich, I. Newman, M. Szegedy, Regular languages are testable with a constant number of queries, Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS), IEEE, New York, 1999, pp. 645-655. Alon N., Krivelevich M., Newman I., Szegedy M. SIAM J. Comput. 30:2001;1842-1862.
11. Alon N., Krivelevich M., Sudakov B. Turán numbers of bipartite graphs and related Ramsey-type questions. Combin. Probab. Comput. 12:2003;477-494.
12. N. Alon, A. Shapira, Testing satisfiability, Proceedings of the 13th Annual ACM-SIAM SODA, ACM Press, New York, 2002, pp. 645-654. Alon N., Shapira A. J. Algorithms. 47:2003;87-103.
13. N. Alon, A. Shapira, Testing satisfiability, Proceedings of the 13th Annual ACM-SIAM SODA, ACM Press, New York, 2002, pp. 645-654. Alon N., Shapira A. J. Algorithms. 47:2003;87-103.
14. N. Alon, A. Shapira, Testing subgraphs in directed graphs, Proceedings of the 35th Annual Symposium on Theory of Computing (STOC), San Diego, CA, 2003, pp. 700-709.
15. N. Alon, A. Shapira, A characterization of easily testable induced subgraphs, Proceedings of the 15th Annual ACM-SIAM SODA, ACM Press, New York, 2004, pp. 935-944.
16. N. Alon, A. Shapira, Linear equations, arithmetic progressions and hypergraph property testing, Manuscript, 2004.
17. Bang-Jensen J., Hell P. The effect of two cycles on the complexity of colorings by directed graphs. Discrete Appl. Math. 26:1990;1-23.
18. Behrend F.A. On sets of integers which contain no three terms in arithmetic progression. Proc. Natl. Acad. Sci. USA. 32:1946;331-332.
19. A. Bogdanov, K. Obata, L. Trevisan, A lower bound for testing 3-colorability in bounded-degree graphs, Proceedings of the 43rd IEEE FOCS, IEEE, New York, 2002, pp. 93-102.
20. Bollobás B., Erdös P., Simonovits M., Szemerédi E. Extremal graphs without large forbidden subgraphs. Ann. Discrete Math. 3:1978;29-41.
21. A. Czumaj, C. Sohler, Testing hypergraph coloring, Proceedings of ICALP, 2001, pp. 493-505.
22. A. Czumaj, C. Sohler, Property testing in computational geometry, Proceedings of the Eighth Annual European Symposium on Algorithms, 2000, pp. 155-166.
23. Diestel R. Graph Theory. 2nd Edition:2000;Springer, New York.
24. Erdos P. On extremal problems of graphs and generalized graphs. Israel J. Math. 2:1964;183-190.
25. Erdos P., Simonovits M. Supersaturated graphs and hypergraphs. Combinatorica. 3:1983;181-192.
26. Fischer E. The art of uninformed decisions: a primer to property testing. Comput. Complexity Column Bull. Eur. Assoc. Theoret. Comput. Sci. 75:2001;97-126.
27. Frieze A., Kannan R. Quick approximation to matrices and applications. Combinatorica. 19:1999;175-220.
28. O. Goldreich, S. Goldwasser, D. Ron, Property testing and its connection to learning and approximation, Proceedings of the 37th Annual IEEE FOCS, 1996, pp. 339-348 Goldreich O., Goldwasser S., Ron D. J. Assoc. Comput. Mach. 45:1998;653-750.
29. O. Goldreich, S. Goldwasser, D. Ron, Property testing and its connection to learning and approximation, Proceedings of the 37th Annual IEEE FOCS, 1996, pp. 339-348 Goldreich O., Goldwasser S., Ron D. J. Assoc. Comput. Mach. 45:1998;653-750.
30. Goldreich O., Trevisan L. Three theorems regarding testing graph properties. Random Struct. Algorithms. 23(1):2003;23-57.
31. Gowers W.T. Lower bounds of tower type for Szemerédi's Uniformity Lemma. Geom. Funct. Anal. 7:1997;322-337.
32. Hell P., Nesetril J. The core of a graph. Discrete Math. 109:1992;117-126.
33. Hell P., Nesetril J., Zhu X. Duality of graph homomorphisms. Miklós D., al. et Combinatorics, Paul Erdos is Eighty. Vol. 2:1996;271-282 Bolyai Society Mathematical Studies, Budapest, Hungary.
34. Komlós J., Simonovits M. Szemerédi's regularity lemma and its applications in graph theory. Miklós D., al. et Combinatorics, Paul Erdos is Eighty. Vol. 2:1996;295-352 Bolyai Society Mathematical Studies, Budapest, Hungary.
35. Rödl V., Duke R. On graphs with small subgraphs of large chromatic number. Graphs Combin. 1:1985;91-96.
36. Ron D. Property testing. Pardalos P.M., Rajasekaran S., Reif J., Rolim J.D.P. Handbook of Randomized Computing, Vol. II. 2001;597-649 Kluwer Academic Publishers, Dordrecht.
37. Rubinfeld R., Sudan M. Robust characterization of polynomials with applications to program testing. SIAM J. Comput. 25:1996;252-271.
38. E. Szemerédi, Regular partitions of graphs, in: J.C. Bermond, J.C. Fournier, M. Las Vergnas, D. Sotteau (Eds.), Proceedings of the Colloque International CNRS, 1978, pp. 399-401.
39. A.C. Yao, Probabilistic computation, towards a unified measure of complexity, Proceedings of the 18th IEEE FOCS, 1977, pp. 222-227.