Abstract
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 n 2, 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).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ailon, N., Chazelle, B., Comandur, S., Liue, D.: Estimating the distance to a monotone function. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol. 3122, pp. 229–236. Springer, Heidelberg (2004)
Alon, N., Kaufman, T., Krivilevich, M., Ron, D.: Testing triangle-freeness in general graphs. In: Proceedings of the 17th SODA, pp. 279–288 (2006)
Chazelle, B., Rubinfeld, R., Trevisan, L.: Approximating the minimum spanning tree weight in sublinear time. SICOMP 34(6), 1370–1379 (2005)
Feige, U.: On sums of independent random variables with unbounded variance and estimating the average degree in a graph. In: Proceedings of the 36th STOC, pp. 594–603 (2004)
Fischer, E., Fortnow, L.: Tolerant versus intolerant testing for boolean properties. In: Proceedings of the 20th IEEE Conference on Computational Complexity, pp. 135–140 (2005)
Fischer, E., Newman, I.: Testing versus estimation of graph properties. In: Proceedings of the 37th STOC, pp. 138–146 (2005)
Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. JACM 45(4), 653–750 (1998)
Goldreich, O., Ron, D.: Property testing in bounded degree graphs. Algorithmica 32(2), 302–343 (2002)
Goldreich, O., Ron, D.: Approximating average parameters of graphs. In: Díaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol. 4110, pp. 363–374. Springer, Heidelberg (2006)
Guruswami, V., Rudra, A.: Tolerant locally testable codes. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX 2005 and RANDOM 2005. LNCS, vol. 3624, pp. 306–317. Springer, Heidelberg (2005)
Karger, D.: Global min-cuts in RNC and other ramifications of a simple mincut algorithm. In: Proceedings of the 4th SODA, pp. 21–30 (1993)
Kaufman, T., Krivelevich, M., Ron, D.: Tight bounds for testing bipartiteness in general graphs. SICOMP 33(6), 1441–1483 (2004)
Luby, M.: A simple parallel algorithm for the maximal independent set problem. SICOMP 15(2), 1036–1055 (1986)
Marko, S., Ron, D.: Distance approximation in bounded-degree and general sparse graphs (manuscript, 2006), available from: www.eng.tau.ac.il/~danar
Naor, D., Gusfield, D., Martel, C.: A fast algorithm for optimally increasing the edge connectivity. SICOMP 26(4), 1139–1165 (1997)
Parnas, M., Ron, D.: Testing the diameter of graphs. Random Structures and Algorithms 20(2), 165–183 (2002)
Parnas, M., Ron, D.: On approximating the minimum vertex cover in sublinear time and the connection to distributed algorithms. ECCC Report TR05-094 (2005)
Parnas, M., Ron, D., Rubinfeld, R.: Tolerant property testing and distance approximation. ECCC Report TR04-010 (2004) To appear in: JCSS
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Marko, S., Ron, D. (2006). Distance Approximation in Bounded-Degree and General Sparse Graphs. In: Díaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. APPROX RANDOM 2006 2006. Lecture Notes in Computer Science, vol 4110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11830924_43
Download citation
DOI: https://doi.org/10.1007/11830924_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38044-3
Online ISBN: 978-3-540-38045-0
eBook Packages: Computer ScienceComputer Science (R0)