Complexity of network synchronization
Journal of the ACM (JACM)
Property testing in bounded degree graphs
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Testing problems with sublearning sample complexity
Journal of Computer and System Sciences
Robust Characterizations of Polynomials withApplications to Program Testing
SIAM Journal on Computing
Testing membership in parenthesis languages
Random Structures & Algorithms
Machine Learning
Testing triangle-freeness in general graphs
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
On testable properties in bounded degree graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
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
Testing Euclidean minimum spanning trees in the plane
ACM Transactions on Algorithms (TALG)
Every minor-closed property of sparse graphs is testable
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Testing monotonicity over graph products
Random Structures & Algorithms
On the Query Complexity of Testing Orientations for Being Eulerian
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Fast computation of empirically tight bounds for the diameter of massive graphs
Journal of Experimental Algorithmics (JEA)
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)
Property Testing: A Learning Theory Perspective
Foundations and Trends® in Machine Learning
Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
Relational properties expressible with one universal quantifier are testable
SAGA'09 Proceedings of the 5th international conference on Stochastic algorithms: foundations and applications
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Testing expansion in bounded-degree graphs
Combinatorics, Probability and Computing
Introduction to testing graph properties
Property testing
Property testing
Introduction to testing graph properties
Property testing
Property testing
Towards privacy for social networks: a zero-knowledge based definition of privacy
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Introduction to testing graph properties
Studies in complexity and cryptography
Contemplations on testing graph properties
Studies in complexity and cryptography
On approximating the number of relevant variables in a function
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Testing Eulerianity and connectivity in directed sparse graphs
Theoretical Computer Science
Algorithmic Aspects of Property Testing in the Dense Graphs Model
SIAM Journal on Computing
On the query complexity of testing orientations for being Eulerian
ACM Transactions on Algorithms (TALG)
Approximating average parameters of graphs
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Distance approximation in bounded-degree and general sparse graphs
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Testing the (s,t)-disconnectivity of graphs and digraphs
Theoretical Computer Science
Testable and untestable classes of first-order formulae
Journal of Computer and System Sciences
SIAM Journal on Discrete Mathematics
Principles of network computing
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Testing the lipschitz property over product distributions with applications to data privacy
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
On Approximating the Number of Relevant Variables in a Function
ACM Transactions on Computation Theory (TOCT)
| Hi-index | 0.00 |
We propose a general model for testing graph properties, which extends and simplifies the bounded degree model of Goldreich and Ron [Property Testing in Bounded Degree Graphs, Proc. 31st Annual ACM Symposium on the Theory of Computing, 1997, pp. 406-415.] In this model, we present a family of algorithms that test whether the diameter of a graph is bounded by a given parameter D, or is ε-far from any graph with diameter at most β(D). The function β(D) ranges between D + 4 and 4D + 2, depending on the algorithm. All our algorithms run in time polynomial in 1/ε.