A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Fault-Tolerant Labeling and Compact Routing Schemes
[article]

2021
*
arXiv
*
pre-print

The paper presents fault-tolerant (FT) labeling schemes for general graphs, as well as, improved FT routing schemes. For a given n-vertex graph G and a bound f on the number of faults, an f-FT connectivity labeling scheme is a distributed data structure that assigns each of the graph edges and vertices a short label, such that given the labels of the vertices s and t, and at most f failing edges F, one can determine if s and t are connected in G ∖ F. The primary complexity measure is the length

arXiv:2106.00374v1
fatcat:wfgpkcdqdzb5zkh4crwjk65loa