Fault-tolerant connectivity labelings are schemes that, given an n-vertex graph G = ( V , E ) and a parameter f, produce succinct yet informative labels for the elements of the graph. Given only the labels of two vertices u, v and of the elements in a faulty-... ...
