Local Reconstructors and Tolerant Testers for Connectivity and Diameter

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.

[1]  Dana Ron,et al.  Property Testing in Bounded Degree Graphs , 2002, STOC '97.

[2]  Zvika Brakerski.  Local Property Restoring , 2008 .

[3]  Bernard Chazelle,et al.  Property-Preserving Data Reconstruction , 2004, Algorithmica.

[4]  Ronitt Rubinfeld,et al.  Tolerant property testing and distance approximation , 2006, J. Comput. Syst. Sci..

[5]  Charles U. Martel,et al.  A Fast Algorithm for Optimally Increasing the Edge Connectivity , 1997, SIAM J. Comput..

[6]  Bernard Chazelle,et al.  Approximating the Minimum Spanning Tree Weight in Sublinear Time , 2001, ICALP.

[7]  Nikolaus Correll,et al.  Decentralized self-repair to maintain connectivity and coverage in networked multi-robot systems , 2011, 2011 IEEE International Conference on Robotics and Automation.

[8]  Sofya Raskhodnikova,et al.  Testing and Reconstruction of Lipschitz Functions with Applications to Data Privacy , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[9]  Michael Luby,et al.  A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.

[10]  Vijay Kumar,et al.  Connectivity management in mobile robot teams , 2008, 2008 IEEE International Conference on Robotics and Automation.

[11]  Ronitt Rubinfeld,et al.  Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..

[12]  Noga Alon,et al.  Decreasing the diameter of bounded degree graphs , 2000 .

[13]  Yuval Peres,et al.  Noise Tolerance of Expanders and Sublinear Expander Reconstruction , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[14]  Yuichi Yoshida,et al.  An improved constant-time approximation algorithm for maximum~matchings , 2009, STOC '09.

[15]  K. Menger.  Zur allgemeinen Kurventheorie , 1927 .

[16]  Dana Ron,et al.  Property Testing in Bounded Degree Graphs , 1997, STOC.

[17]  GoldreichOded,et al.  Property testing and its connection to learning and approximation , 1998 .

[18]  Kyomin Jung,et al.  Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners , 2010, APPROX-RANDOM.

[19]  Ronitt Rubinfeld,et al.  Fast Local Computation Algorithms , 2011, ICS.

[20]  Dana Ron,et al.  Testing the diameter of graphs , 1999, RANDOM-APPROX.

[21]  Krzysztof Onak,et al.  A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size , 2011, SODA.

[22]  Dana Ron,et al.  Property testing and its connection to learning and approximation , 1998, JACM.

[23]  D. Ron,et al.  Testing properties of directed graphs: acyclicity and connectivity , 2002 .

[24]  Michael E. Saks,et al.  Local Monotonicity Reconstruction , 2010, SIAM J. Comput..

[25]  Bernard Chazelle,et al.  Online geometric reconstruction , 2006, SCG '06.

[26]  Dana Ron,et al.  Approximating the distance to properties in bounded-degree and general sparse graphs , 2009, TALG.

[27]  Krzysztof Onak,et al.  Constant-Time Approximation Algorithms via Local Improvements , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.