The complexity of promise problems with applications to public-key cryptography
Information and Control
Self-testing/correcting with applications to numerical problems
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Lower bounds for sampling algorithms for estimating the average
Information Processing Letters
MAX-CUT has a randomized approximation scheme in dense graphs
Random Structures & Algorithms
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
SIAM Journal on Computing
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Polynomial time approximation schemes for dense instances of NP -hard problems
Journal of Computer and System Sciences
Graph Algorithms
Robust Characterizations of Polynomials withApplications to Program Testing
SIAM Journal on Computing
SIAM Journal on Discrete Mathematics
Testing the diameter of graphs
Random Structures & Algorithms
A Lower Bound for Testing 3-Colorability in Bounded-Degree Graphs
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Approximating the Minimum Spanning Tree Weight in Sublinear Time
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Testing Acyclicity of Directed Graphs in Sublinear Time
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Testing subgraphs in large graphs
Random Structures & Algorithms - Special issue: Proceedings of the tenth international conference "Random structures and algorithms"
Linearity testing in characteristic two
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Testing that distributions are close
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Clique is hard to approximate within n1-
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Three theorems regarding testing graph properties
Random Structures & Algorithms
Lower Bounds for Testing Bipartiteness in Dense Graphs
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
Tight Bounds for Testing Bipartiteness in General Graphs
SIAM Journal on Computing
Testing subgraphs in directed graphs
Journal of Computer and System Sciences - Special issue: STOC 2003
Every monotone graph property is testable
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Testing versus estimation of graph properties
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A Characterization of the (natural) Graph Properties Testable with One-Sided Error
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Testing triangle-freeness in general graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A combinatorial characterization of the testable graph properties: it's all about regularity
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Tolerant property testing and distance approximation
Journal of Computer and System Sciences
A Characterization of Easily Testable Induced Subgraphs
Combinatorics, Probability and Computing
Approximate Hypergraph Partitioning and Applications
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Comparing the strength of query types in property testing: the case of testing k-colorability
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Computational Complexity: A Conceptual Perspective
Computational Complexity: A Conceptual Perspective
Every minor-closed property of sparse graphs is testable
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Approximating average parameters of graphs
Random Structures & Algorithms
Conductance and convergence of Markov chains-a combinatorial treatment of expanders
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
A separation theorem in property testing
Combinatorica
An Expansion Tester for Bounded Degree Graphs
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
On the Benefits of Adaptivity in Property Testing of Dense Graphs
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Approximating the distance to properties in bounded-degree and general sparse graphs
ACM Transactions on Algorithms (TALG)
On proximity oblivious testing
Proceedings of the forty-first annual ACM symposium on Theory of computing
Hierarchy Theorems for Property Testing
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
Local Graph Partitions for Approximation and Testing
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Theoretical Computer Science
A brief introduction to property testing
Studies in complexity and cryptography
Studies in complexity and cryptography
Contemplations on testing graph properties
Studies in complexity and cryptography
| Hi-index | 0.00 |
The aim of this article is to introduce the reader to the study of testing graph properties, while focusing on the main models and issues involved. No attempt is made to provide a comprehensive survey of this study, and specific results are often mentioned merely as illustrations of general themes.