Testing subgraphs in directed graphs

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 700-709

  Alon, Noga ^a   Shapira, Asaf ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Directed Graphs; Property Testing; Regularity Lemma

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; POLYNOMIALS; PROBABILITY; QUERY LANGUAGES;

HOMOMORPHISMS;

COMPUTER SCIENCE;

EID: 0038107507     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780542.780644     Document Type: Conference Paper

References (36)

1. nd IEEE FOCS, IEEE (2001), 434-441.
2. rd IEEE FOCS, Pittsburgh, IEEE (1992), 473-481. Also: J. of Algorithms 16 (1994), 80-109.
3. rd IEEE FOCS, Pittsburgh, IEEE (1992), 473-481. Also: J. of Algorithms 16 (1994), 80-109.
4. th ACM STOC, ACM Press (2002), 232-239.
5. N. Alon, S. Dar, M. Parnas and D. Ron, Testing of clustering, Proc. 41 IEEE FOCS, IEEE (2000), 240-250.
6. th Annual Symp. on Foundations of Computer Science (FOCS), New York, NY, IEEE (1999), 656-666. Also: Combinatorica 20 (2000), 451-476.
7. th Annual Symp. on Foundations of Computer Science (FOCS), New York, NY, IEEE (1999), 656-666. Also: Combinatorica 20 (2000), 451-476.
8. th Annual Symp. on Foundations of Computer Science (FOCS), New York, NY, IEEE (1999), 645-655. Also: SIAM J. on Computing 30 (2001), 1842-1862.
9. th Annual Symp. on Foundations of Computer Science (FOCS), New York, NY, IEEE (1999), 645-655. Also: SIAM J. on Computing 30 (2001), 1842-1862.
10. N. Alon and M. Krivelevich, Testing k-colorability, SIAM J. Discrete Math., 15 (2002), 211-227.
11. N. Alon, M. Krivelevich and B. Sudakov, Turán numbers of bipartite graphs and related Ramsey-type questions, submitted.
12. th Annual ACM-SIAM SODA, ACM Press (2002), 645-654. Also: J. of Algorithms, to appear.
13. th Annual ACM-SIAM SODA, ACM Press (2002), 645-654. Also: J. of Algorithms, to appear.
14. J. Bang-Jensen and P. Hell, The effect of two cycles on the complexity of colorings by directed graphs, Discrete Applied Math. 26 (1990), 1-23.
15. F. A. Behrend, On sets of integers which contain no three terms in arithmetic progression, Proc. National Academy of Sciences USA 32 (1946), 331-332.
16. rd IEEE FOCS, IEEE (2002), 93-102.
17. B. Bollobás, P. Erdös, M. Simonovits and E. Szemerédi, Extremal graphs without large forbidden subgraphs, Annals of Discrete Mathematics 3 (1978), 29-41.
18. A. Czumaj and C. Sohler, Testing hypergraph coloring, Proc. of ICALP 2001, 493-505.
19. A. Czumaj and C. Sohler, Property testing in computational geometry, Proceedings of the 8th Annual European Symposium on Algorithms (2000), 155-166.
20. Reinhard Diestel, Graph Theory, Second Edition, Springer-Verlag, New York, 2000.
21. P. Erdos, P. On extremal problems of graphs and generalized graphs. Israel J. Math. 2 1964 183-190.
22. P. Erdos and M. Simonovits, Supersaturated graphs and hypergraphs, Combinatorica 3 (1983), 181-192.
23. E. Fischer, The art of uninformed decisions: A primer to property testing, The Computational Complexity Column of The Bulletin of the European Association for Theoretical Computer Science 75 (2001), 97-126.
24. A. Frieze and R. Kannan, Quick approximation to matrices and applications, Combinatorica 19 (1999), 175-220.
25. th Annual IEEE FOCS (1996), 339-348. Also: Journal of the ACM 45 (1998), 653-750.
26. th Annual IEEE FOCS (1996), 339-348. Also: Journal of the ACM 45 (1998), 653-750.
27. nd IEEE FOCS, IEEE (2001), 460-469.
28. W. T. Gowers, Lower bounds of tower type for Szemerédi's Uniformity Lemma, Geometric and Functional Analysis 7 (1997), 322-337.
29. P. Hell and J. Nesetril, The core of a graph, Discrete Math 109 (1992), 117-126.
30. P. Hell, J. Nesetril, and X. Zhu, Duality of graph homomorphisms, in: Combinatorics, Paul Erdos is Eighty, (D. Miklós et. al, eds.), Bolyai Society Mathematical Studies, Vol.2, 1996, pp. 271-282.
31. J. Komlós and M. Simonovits, Szemerédi's regularity lemma and its applications in graph theory, in: Combinatorics, Paul Erdos is Eighty, (D. Miklós et. al, eds.), Bolyai Society Mathematical Studies, Vol.2, 1996, pp. 295-352.
32. V. Rödl and R. Duke, On graphs with small subgraphs of large chromatic number, Graphs and Combinatorics 1 (1985), 91-96.
33. D. Ron, Property testing, in: P. M. Pardalos, S. Rajasekaran, J. Reif and J. D. P. Rolim, editors, Handbook of Randomized Computing, Vol. II, Kluwer Academic Publishers, 2001, 597-649.
34. R. Rubinfeld and M. Sudan, Robust characterization of polynomials with applications to program testing, SIAM J. on Computing 25 (1996), 252-271.
35. E. Szemerédi, Regular partitions of graphs, In: Proc. Collogue Inter. CNRS (J. C. Bermond, J. C. Fournier, M. Las Vergnas and D. Sotteau, eds.), 1978, 399-401.
36. th IEEE FOCS (1977), 222-227.