Connectivity Labeling and Routing with Multiple Vertex Failures
Merav Parter, Asaf Petruschka, Seth Pettie
Abstract
We present succinct labeling schemes for answering connectivity queries in graphs subject to a specified number of vertex failures. An f -vertex/edge fault tolerant (f -V/EFT) connectivity labeling is a scheme that produces succinct labels for the vertices (and possibly to the edges) of an n-vertex graph G, such that given only the labels of two vertices s, t and of at most f faulty vertices/edges F , one can infer if s and t are connected in G -F . The primary complexity measure is the maximum label length (in bits).
The f -EFT setting is relatively well understood: [Dory and Parter, PODC 2021] gave a randomized scheme with succinct labels of O(log 3 n) bits, which was subsequently derandomized by [Izumi et al., PODC 2023] with Õ(f 2 )-bit labels. As both noted, handling vertex faults is more challenging. The known bounds for the f -VFT setting are far away: [Parter and Petruschka, DISC 2022] gave Õ(n 1-1/2 Θ(f ) )-bit labels, which is linear in n already for f = Ω(log log n).
In this work we present an efficient f -VFT connectivity labeling scheme using poly(f, log n) bits. Specifically, we present a randomized scheme with O(f 3 log 5 n)-bit labels, and a derandomized version with O(f 7 log 13 n)-bit labels, compared to an Ω(f )-bit lower bound on the required label length. Our schemes are based on a new low-degree graph decomposition that improves on [Duan and Pettie, SODA 2017], and facilitates its distributed representation into labels. This is accompanied with specialized linear graph sketches that extend the techniques of the Dory and Parter to the vertex fault setting, which are derandomized by adapting the approach of Izumi et al. and combining it with hit-miss hash families of [Karthik and Parter, SODA 2021].
Finally, we show that our labels naturally yield routing schemes avoiding a given set of at most f vertex failures with table and header sizes of only poly(f, log n) bits. This improves significantly over the linear size bounds implied by the EFT routing scheme of Dory and Parter.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext d2720ec8-b254-46f0-be15-fb032e1ce183Cited by top-tier papers3
- Connectivity Labeling Schemes for Edge and Vertex Faults via Expander HierarchiesYaowei Long, Seth Pettie, Thatchaphol SaranurakSODA 2025 · 2 citations
- New Oracles and Labeling Schemes for Vertex Cut QueriesYonggang Jiang, Merav Parter, Asaf PetruschkaSODA 2026
- Parks and Recreation: Color Fault-Tolerant Spanners Made LocalMerav Parter, Asaf Petruschka, Shay Sapir, Elad TzalikSODA 2025
Builds on3
- Deterministic Replacement Path CoveringKarthik C. S., Merav ParterSODA 2021 · 15 citations
- Near-Optimal Deterministic Vertex-Failure Connectivity OraclesYaowei Long, Thatchaphol SaranurakFOCS 2022 · 6 citations
- Approximate Distance Oracles Subject to Multiple Vertex FailuresRan Duan, Yong Gu, Hanlin RenSODA 2021 · 5 citations
Related papers
- A Constant-Approximation Distance Labeling Scheme under Polynomially Many Edge FailuresBernhard Haeupler, Yaowei Long, Antti Roeyskoe, Thatchaphol SaranurakSTOC 2026
- Adjacency Sketches in Adversarial EnvironmentsMoni Naor, Eugene PekelSODA 2024 · 1 citation
- Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar GraphsItai Boneh, Shiri Chechik, Shay Golan, Shay Mozes et al.STOC 2025 · 1 citation
- Optimal vertex connectivity oraclesSeth Pettie, Thatchaphol Saranurak, Longhui YinSTOC 2022 · 5 citations
- Nearly optimal vertex fault-tolerant spanners in optimal time: sequential, distributed, and parallelMerav ParterSTOC 2022 · 8 citations
