A Characterization of Easily Testable Induced Subgraphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 935-944

  Alon, Noga ^a   Shapira, Asaf ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBABILITY DISTRIBUTIONS; THEOREM PROVING;

QUERY COMPLEXITY; SUBGRAPHS;

GRAPH THEORY;

EID: 1842591329     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (35)

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. st IEEE FOCS, IEEE (2000), 240-250.
6. th FOCS, New York, NY, IEEE (1999), 656-666. Also: Combinatorica 20 (2000), 451-476.
7. th FOCS, New York, NY, IEEE (1999), 656-666. Also: Combinatorica 20 (2000), 451-476.
8. th FOCS, New York, NY, IEEE (1999), 645-655. Also: SIAM J. on Computing 30 (2001), 1842-1862.
9. th 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. th Annual ACM-SIAM SODA, ACM Press (2002), 645-654. Also: Journal of Algorithms, 47 (2003), 87-103.
12. th Annual ACM-SIAM SODA, ACM Press (2002), 645-654. Also: Journal of Algorithms, 47 (2003), 87-103.
13. th Annual Symp. on Theory of Computing (STOC), San Diego, California, 2003, 700-709.
14. 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.
15. rd IEEE FOCS, IEEE (2002), 93-102.
16. 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.
17. D. G. Corneil, H. Lerchs, L. Stewart Burlingham, Complement Reducible Graphs, Discrete Applied Mathematics 3 (1981), 163-174.
18. D. G. Corneil, Y. Perl and L. K. Stewart, A linear recognition algorithm for cographs, SIAM J. Comput. 14 (1985), 926-934.
19. A. Czumaj and C. Sohler, Testing hypergraph coloring, Proc. of ICALP 2001, 493-505.
20. A. Czumaj and C. Sohler, Property testing in computational geometry, Proceedings of the 8th Annual European Symposium on Algorithms (2000), 155-166.
21. P. Erdös, P. Frankl and V. Rödl, The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent, Graphs Combin. 2 (1986) 113-121.
22. 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.
23. rd FOCS (2002), 103-112.
24. th STOC (2002), 474-483.
25. A. Frieze and R. Kannan, Quick approximation to matrices and applications, Combinatorial 19 (1999), 175-220.
26. O. Goldreich, Combinatorial property testing - a survey, In: Randomization Methods in Algorithm Design (P. Pardalos, S. Rajasekaran and J. Rolim eds.), AMS-DIMACS (1998), 45-60.
27. th Annual IEEE FOCS (1996), 339-348.
28. nd IEEE FOCS, IEEE (2001), 460-469.
29. R. L. Graham, B. L. Rothschild and J. H. Spencer, Ramsey Theory, Second Edition, Wiley, New York, 1990.
30. T. A. McKee and F.R. McMorris, Topics in Intersection Graph Theory, SIAM, Philadelphia, PA, 1999.
31. V. Rödl and R. Duke, On graphs with small subgraphs of large chromatic number, Graphs and Combinatorics 1 (1985), 91-96.
32. 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.
33. R. Rubinfeld and M. Sudan, Robust characterization of polynomials with applications to program testing, SIAM J. on Computing 25 (1996), 252-271.
34. E. Szemerédi, Regular partitions of graphs, In: Proc. Colloque Inter. CNRS (J. C. Bermond, J. C. Fournier, M. Las Vergnas and D. Sotteau, eds.), 1978, 399-401.
35. th IEEE FOCS (1977), 222-227.