A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Local Reconstructors and Tolerant Testers for Connectivity and Diameter
[chapter]
2013
Lecture Notes in Computer Science
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
doi:10.1007/978-3-642-40328-6_29
fatcat:sw7xhprozbchfjmxsbeonjzsq4