Abstract
A local property reconstructor for a graph property is an algorithm which, given oracle access to the adjacency list of a graph that is “close” to having the property, provides oracle access to the adjacency matrix of a “correction” of the graph, i.e. a graph which has the property and is close to the given graph. For this model, we achieve local property reconstructors for the properties of connectivity and k-connectivity in undirected graphs, and the property of strong connectivity in directed graphs. Along the way, we present a method of transforming a local reconstructor (which acts as a “adjacency matrix oracle” for the corrected graph) into an “adjacency list oracle”. This allows us to recursively use our local reconstructor for (k − 1)-connectivity to obtain a local reconstructor for k-connectivity.
We also extend this notion of local reconstruction to parametrized graph properties (for instance, having diameter at most D for some parameter D) and require that the corrected graph has the property with parameter close to the original. We obtain a local reconstructor for the low diameter property, where if the original graph is close to having diameter D, then the corrected graph has diameter roughly 2D.
We also exploit a connection between local property reconstruction and property testing, observed by Brakerski, to obtain new tolerant property testers for all of the aforementioned properties. Except for the one for connectivity, these are the first tolerant property testers for these properties.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ailon, N., Chazelle, B., Comandur, S., Liu, D.: Property-preserving data reconstruction. In: Proc. 15th International Symposium on Algorithms and Computation, pp. 16–27 (2004)
Alon, N., Gyàrfàs, A., Ruszinkò, M.: Decreasing the diameter of bounded degree graphs. J. Graph Theory 35, 161–172 (2000)
Bender, M.A., Ron, D.: Testing properties of directed graphs: acyclicity and connectivity. Random Structures and Algorithms 20, 184–205 (2002)
Bhattacharyya, A., Grigorescu, E., Jha, M., Jung, K., Raskhodnikova, S., Woodruff, D.P.: Lower bounds for local monotonicity reconstruction from transitive-closure spanners. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds.) APPROX and RANDOM 2010. LNCS, vol. 6302, pp. 448–461. Springer, Heidelberg (2010)
Brakerski, Z.: Local property restoring. Manuscript (2008)
Campagna, A., Guo, A., Rubinfeld, R.: Local reconstructors and tolerant testers for connectivity and diameter. ArXiv preprint. arXiv.DS:1208.2956
Chazelle, B., Rubinfeld, R., Trevisan, L.: Approximating the Minimum Spanning Tree Weight in Sublinear Time. SIAM J. Comput. 34(6), 1370–1379 (2005)
Chazelle, B., Seshadhri, C.: Online geometric reconstruction. In: Proc. 22nd ACM Symposium on Computational Geometry, pp. 386–394 (2006)
Derbakova, A., Correll, N., Rus, D.: Decentralized self-repair to maintain connectivity and coverage in networked multi-robot systems. In: Proc. IEEE International Conference on Robotics and Automation (2011)
Goldreich, O., Goldwasser, S., Ron, D.: Property Testing and its Connection to Learning and Approximation. J. ACM 45(4), 653–750 (1998)
Goldreich, O., Ron, D.: Property testing in bounded degree graphs. Algorithmica 32, 302–343 (2002)
Jha, M., Raskhodnikova, S.: Testing and reconstruction of Lipschitz functions with applications to data privacy. In: Proc. 52nd Annual IEEE Symposium on Foundations of Computer Science, pp. 433–442
Kale, S., Peres, Y., Seshadhri, C.: Noise tolerance of expanders and sublinear expander reconstruction. In: Proc. 49th Annual IEEE Symposium on Foundations of Computer Science, pp. 719–728 (2008)
Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM Journal on Computing 15(4), 1036–1053 (1986)
Marko, S., Ron, D.: Approximating the distance to properties in bounded-degree and general sparse graphs. ACM Transactions on Algorithms 5(2) (2009)
Menger, K.: Zur allgemeinen Kurventheorie. Fund. Math. 10, 96–115 (1927)
Nguyen, H.N., Onak, K.: Constant-time approximation algorithms via local improvements. In: Proc. 49th Annual IEEE Symposium on Foundations of Computer Science, pp. 327–336 (2008)
Noar, D., Gusfield, D., Martel, C.: A fast algorithm for optimally increasing the edge connectivity. SICOMP 26(4), 1139–1165 (1997)
Onak, K., Ron, D., Rosen, M., Rubinfeld, R.: A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size. In: Proc. 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1123–1131 (2012)
Parnas, M., Ron, D.: Testing the diameter of graphs. Random Structures and Algorithms 20, 165–183 (2002)
Parnas, M., Ron, D., Rubinfeld, R.: Tolerant property testing and distance approximation. Journal of Computer and System Sciences 72, 1012–1042 (2006)
Rubinfeld, R., Sudan, M.: Robust Characterizations of Polynomials with Applications to Program Testing. SIAM J. Comput. 25(2), 252–271 (1996)
Rubinfeld, R., Tamir, G., Vardi, S., Xie, N.: Fast local computation algorithms. In: Proc. 2nd Symposium on Innovations in Computer Science, pp. 223–238 (2011)
Saks, M.E., Seshadhri, C.: Local monotonicity reconstruction. SIAM Journal on Computing 39, 2897–2926 (2010)
Stump, E., Jadbabaie, A., Kumar, V.: Connectivity management in mobile robot teams. In: Proc. IEEE International Conference on Robotics and Automation (2008)
Yoshida, Y., Yamamoto, M., Ito, H.: An improved constant-time approximation algorithm for maximum matchings. In: Proc. 41st ACM Symposium on Theory of Computing, pp. 225–234 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Campagna, A., Guo, A., Rubinfeld, R. (2013). Local Reconstructors and Tolerant Testers for Connectivity and Diameter. In: Raghavendra, P., Raskhodnikova, S., Jansen, K., Rolim, J.D.P. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. APPROX RANDOM 2013 2013. Lecture Notes in Computer Science, vol 8096. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40328-6_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-40328-6_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40327-9
Online ISBN: 978-3-642-40328-6
eBook Packages: Computer ScienceComputer Science (R0)