Deterministic Fault-Tolerant Connectivity Labeling Scheme

Taisuke Izumi, Yuval Emek, Tadashi Wadayama, Toshimitsu Masuzawa

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


The f-fault-tolerant connectivity labeling (f-FTC labeling) is a scheme of assigning each vertex and edge with a small-size label such that one can determine the connectivity of two vertices s and t under the presence of at most f faulty edges only from the labels of s, t, and the faulty edges. This paper presents a new deterministic f-FTC labeling scheme attaining O(f2 polylog(n))-bit label size and a polynomial construction time, which settles the open problem left by Dory and Parter [18]. The key ingredient of our construction is to develop a deterministic counterpart of the graph sketch technique by Ahn, Guha, and McGreger [4], via some natural connection with the theory of error-correcting codes. This technique removes one major obstacle in de-randomizing the Dory-Parter scheme. The whole scheme is obtained by combining this technique with a new deterministic graph sparsification algorithm derived from the seminal ϵ-net theory, which is also of independent interest. As byproducts, our result deduces the first deterministic fault-tolerant approximate distance labeling scheme with a non-trivial performance guarantee and an improved deterministic fault-tolerant compact routing. The authors believe that our new technique is potentially useful in the future exploration of more efficient FTC labeling schemes and other related applications based on graph sketches.

Original languageEnglish
Title of host publicationPODC 2023 - Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing
Number of pages10
ISBN (Electronic)9798400701214
StatePublished - 19 Jun 2023
Event42nd ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2023 - Orlando, United States
Duration: 19 Jun 202323 Jun 2023

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing


Conference42nd ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2023
Country/TerritoryUnited States


  • fault-tolerant data structure
  • graph connectivity
  • labeling scheme

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications


Dive into the research topics of 'Deterministic Fault-Tolerant Connectivity Labeling Scheme'. Together they form a unique fingerprint.

Cite this