Efficient testing of bipartite graphs for forbidden induced subgraphs

SIAM Journal on Computing

Volumn 37, Issue 3, 2007, Pages 959-976

  Alon, Noga ^a,b   Fischer, Eldar ^c   Newman, Ilan ^d  

^a TEL AVIV UNIVERSITY   (Israel)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^d UNIVERSITY OF HAIFA   (Israel)

Author keywords

Approximation; Graph algorithms; Property testing; Regularity lemma

Indexed keywords

(ALGORITHMIC) COMPLEXITY; APPLIED MATHEMATICS; BINARY MATRICES; BIPARTITE GRAPHS; FISCHER; FORBIDDEN INDUCED SUBGRAPHS; PROPERTY (S); REGULARITY LEMMA;

TESTING;

GRAPH THEORY;

EID: 46449134870     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/050627915     Document Type: Article

References (21)

1. N. ALON, Testing subgraphs in large graphs, Random Structures Algorithms, 21 (2002), pp. 359-370.
2. N. ALON, S. DAR, M. PARNAS, AND D. RON, Testing of clustering, SIAM J. Discrete Math., 16 (2003), pp. 393-417.
3. N. ALON, E. FISCHER, M. KRIVELEVICH. AND M. SZEGEDY, Efficient testing of large graphs, Combinatorica, 20 (2000), pp. 451-476.
4. N. ALON AND A. SHAPIRA, Testing subgraphs in directed graphs, J. Comput. System Sci., 69 (2004), pp. 354-382.
5. N. ALON AND J. H. SPENCER, The Probabilistic Method, 2nd ed., John Wiley, New York, 2000.
6. M. BLUM, M. LUBY, AND R. RUBINFELD, Self- testing /correcting with applications to numerical problems, J. Comput. System Sci., 47 (1993), pp. 549-595.
7. R. DIESTEL, Graph Theory, 2nd ed., Springer-Verlag, New York, 2000.
8. E. FISCHER, Testing graphs for colorability properties, Random Structures Algorithms, 26 (2005), pp. 289-309.
9. E. FISCHER, The art, of uninformed decisions: A primer to property testing, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, 75 (2001), pp. 97-126.
10. E. FISCHER AND I. NEWMAN, Testing of matrix properties, in Proceedings of the 33rd ACM Annual Symposium on Theory of Computing, ACM, New York, 2001, pp. 286-295.
11. E. FISCHER AND I. NEWMAN, Testing of matrix-poset properties, Combinatorica, to appear.
12. W. T. GOWERS, Lower bounds of tower type for Szemerédi's Uniformity Lemma, Geom. Funct. Anal., 7 (1997), pp. 322-337.
13. T. KÖVARY, V.T. SÓS, AND P. TURÁN, On a problem of K. Zarankiewicz, Colloq. Math., 3 (1954), pp. 50-57.
14. O. GOLDREICH, S. GOLDWASSER, AND D. RON, Property testing and its connection to learning and approximation, J. ACM, 45 (1998), pp. 653-750.
15. O. GOLDREICH AND L. TREVISAN, Three theorems regarding testing graph properties, Random Structures Algorithms, 23 (2003), pp. 23-57.
16. D. RON, Property testing (a tutorial), in Handbook of Randomized Computing, Vol. II, S. Ra-jasekaran, P. M, Pardalos, J. H. Reif, and J. D. P. Rohm, eds., Kluwer Academic Publishers, Boston, 2001, pp. 597-649.
17. R. RUBINFELD AND M. SUDAN, Robust characterizations of polynomials with applications to program testing, SIAM J. Comput., 25 (1996), pp. 252-271.
18. N. SAUER, On the density of families of sets, J. Combin. Theory Ser. A, 13 (1972), pp. 145-147.
19. E. SZEMERÉDI, Regular partitions of graphs, in Problems combinatoires et théorie des graphes, Colloq. Internat. CNRS 260, J. C. Bermond, J. C. Fournier, M. Las Vergnas, and D. Sotteau, eds., CNRS, Paris, 1978, pp. 399-401.
20. S. SHELAH, A combinatorial problem: Stability and order for models and theories in infinitary languages, Pacific J. Math., 41 (1972), pp. 247-261.
21. K. ZARANKIEWICZ, Problem P 101, Colloq. Math., 2 (1951), pp. 116-131.