A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
A Fast Algorithm for Optimally Increasing the Edge Connectivity
SIAM Journal on Computing
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Global min-cuts in RNC, and other ramifications of a simple min-out algorithm
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Testing the diameter of graphs
Random Structures & Algorithms
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Tight Bounds for Testing Bipartiteness in General Graphs
SIAM Journal on Computing
Testing versus estimation of graph properties
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Tolerant Versus Intolerant Testing for Boolean Properties
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
Approximating the Minimum Spanning Tree Weight in Sublinear Time
SIAM Journal on Computing
Testing triangle-freeness in general graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Tolerant locally testable codes
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
Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
Theoretical Computer Science
Property Testing: A Learning Theory Perspective
Foundations and Trends® in Machine Learning
An improved constant-time approximation algorithm for maximum~matchings
Proceedings of the forty-first annual ACM symposium on Theory of computing
Approximating the distance to monotonicity in high dimensions
ACM Transactions on Algorithms (TALG)
Space-efficient local computation algorithms
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Converting online algorithms to local computation algorithms
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
We address the problem of approximating the distance of bounded degree and general sparse graphs from having some predetermined graph property $\cal{P}$. Namely, we are interested in sublinear algorithms for estimating the fraction of edges that should be added to / removed from a graph so that it obtains $\cal{P}$. This fraction is taken with respect to a given upper bound m on the number of edges. In particular, for graphs with degree bound d over n vertices, m = dn. To perform such an approximation the algorithm may ask for the degree of any vertex of its choice, and may ask for the neighbors of any vertex. The problem of estimating the distance to having a property was first explicitly addressed by Parnas et. al. (ECCC 2004). In the context of graphs this problem was studied by Fischer and Newman (FOCS 2005) in the dense-graphs model. In this model the fraction of edge modifications is taken with respect to n2, and the algorithm may ask for the existence of an edge between any pair of vertices of its choice. Fischer and Newman showed that every graph property that has a testing algorithm in this model with query complexity that is independent of the size of the graph, also has a distance-approximation algorithm with query complexity that is independent of the size of the graph. In this work we focus on bounded-degree and general sparse graphs, and give algorithms for all properties that were shown to have efficient testing algorithms by Goldreich and Ron (Algorithmica, 2002). Specifically, these properties are k-edge connectivity, subgraph-freeness (for constant size subgraphs), being a Eulerian graph, and cycle-freeness. A variant of our subgraph-freeness algorithm approximates the size of a minimum vertex cover of a graph in sublinear time. This approximation improves on a recent result of Parnas and Ron (ECCC 2005).