SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Testing subgraphs in large graphs
Random Structures & Algorithms - Special issue: Proceedings of the tenth international conference "Random structures and algorithms"
Sampling lower bounds via information theory
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Testing subgraphs in directed graphs
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Algorithms column: sublinear time algorithms
ACM SIGACT News
A characterization of easily testable induced subgraphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
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
A Characterization of Easily Testable Induced Subgraphs
Combinatorics, Probability and Computing
On the Implementation of Huge Random Objects
SIAM Journal on Computing
Characterizations of locally testable linear-and affine-invariant families
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Characterizations of locally testable linear- and affine-invariant families
Theoretical Computer Science
A lower bound for distribution-free monotonicity testing
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
SIAM Journal on Discrete Mathematics
Hi-index | 0.00 |
Property testing is a relaxation of decision problems in which it is required to distinguish YES-instances (i.e., objects having a predetermined property) from instances that are far from any YES-instance. We presents three theorems regarding testing graph properties in the adjacency matrix representation. More specifically, these theorems relate to the project of characterizing graph properties according to the complexity of testing them (in the adjacency matrix representation).The first theorem is that there exist monotone graph properties in NP for which testing is very hard (i.e., requires to examine a constant fraction of the entries in the matrix). The second theorem is that every graph property that can be tested making a number of queries that is independent of the size of the graph, can be so tested by uniformly selecting a set of vertices and accepting iff the induced subgraph has some fixed graph property (which is not necessarily the same as the one being tested). The third theorem refers to the framework of graph partition problems, and is a characterization of the subclass of properties that can be tested using a one-sided error tester making a number of queries that is independent of the size of the graph.