Property testing in massive graphs

Authors:
Oded Goldreich
Affiliations:
Department of Computer Science and Applied Mathematics, Weizmann Institute of Science, Rehovot, Israel
Venue:
Handbook of massive data sets
Year:
2002

Citing 32
Cited 6

A theory of the learnable

Communications of the ACM
Using dual approximation algorithms for scheduling problems theoretical and practical results

Journal of the ACM (JACM)
A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach

SIAM Journal on Computing
Checking computations in polylogarithmic time

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Self-testing/correcting for polynomials and for approximate functions

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Efficient probabilistically checkable proofs and applications to approximations

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
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
Improved non-approximability results

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Polynomial time approximation schemes for dense instances of NP-hard problems

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
MAX-CUT has a randomized approximation scheme in dense graphs

Random Structures & Algorithms
Interactive proofs and the hardness of approximating cliques

Journal of the ACM (JACM)
Testing of the long code and hardness for clique

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Some optimal inapproximability results

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Property testing in bounded degree graphs

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Probabilistic checking of proofs: a new characterization of NP

Journal of the ACM (JACM)
Spot-checkers

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Recycling queries in PCPs and in linearity tests (extended abstract)

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems

Journal of the ACM (JACM)
Testing problems with sub-learning sample complexity

COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
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)
Graph Algorithms

Graph Algorithms
Robust Characterizations of Polynomials withApplications to Program Testing

SIAM Journal on Computing
Testing k-colorability

SIAM Journal on Discrete Mathematics
Testing the Diameter of Graphs

RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
Improved Testing Algorithms for Monotonicity

RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
Testing Monotonicity

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Efficient Testing of Large Graphs

FOCS '99 Proceedings of the 40th 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
Probabilistically checkable proofs and the testing of hadamard-like codes

Probabilistically checkable proofs and the testing of hadamard-like codes
On the time required to recognize properties of graphs: a problem

ACM SIGACT News
Linearity testing in characteristic two

IEEE Transactions on Information Theory - Part 1

On testable properties in bounded degree graphs

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Separating Sublinear Time Computations by Approximate Diameter

COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Best-Order Streaming Model

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Best-order streaming model

Theoretical Computer Science
Sublinear-time algorithms

Property testing
Sublinear-time algorithms

Property testing

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider the task of evaluating properties of graphs that are too big to be even scanned. Thus, the input graph is given in form of an oracle which answers questions of the form is there an edge between vertices u and υ, or who is the ith neighbor of υ. Our task is to determine whether a given input graph has a predetermined property or is "relatively far" from any graph having the property. Distance between graphs is measured as the fraction of the possible queries on which the corresponding oracles, representing the two graphs, differ. We show that randomized algorithms of running-time substantially smaller than the size of the input graph may reach (with high probability) a correct verdict regarding whether the graph has some predetermined property (such as being bipartite) or is far from having it.