Efficient testing of large graphs

This publication has 10 references indexed in Scilit:

• Regular languages are testable with a constant number of queries
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
• Property testing and its connection to learning and approximation
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• The regularity lemma and approximation schemes for dense problems
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Lower bounds of tower type for Szemerédi's uniformity lemma
  Geometric and Functional Analysis, 1997
• Robust Characterizations of Polynomials with Applications to Program Testing
  SIAM Journal on Computing, 1996
• The Algorithmic Aspects of the Regularity Lemma
  Journal of Algorithms, 1994
• The algorithmic aspects of the regularity lemma
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1992
• On graphs with small subgraphs of large chromatic number
  Graphs and Combinatorics, 1985
• Extremal Graphs without Large Forbidden Subgraphs
  Published by Elsevier ,1978
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
  Proceedings of the National Academy of Sciences, 1946