Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Connectivity Certificate against Bounded-Degree Faults: Simpler, Better and Supporting Vertex Faults

Merav Parter, Elad Tzalik

TL;DR

This work settles the optimal existential size bounds for $f$-EFD certificates (up to constant factors), and extends it to support vertex failures with bounded degrees (where each vertex is incident to at most $f$ faulty vertices).

Abstract

An $f$-edge (or vertex) connectivity certificate is a sparse subgraph that maintains connectivity under the failure of at most $f$ edges (or vertices). It is well known that any $n$-vertex graph admits an $f$-edge (or vertex) connectivity certificate with $Θ(f n)$ edges (Nagamochi and Ibaraki, Algorithmica 1992). A recent work by (Bodwin, Haeupler and Parter, SODA 2024) introduced a new and considerably stronger variant of connectivity certificates that can preserve connectivity under any failing set of edges with bounded degree. For every $n$-vertex graph $G=(V,E)$ and a degree threshold $f$, an $f$-Edge-Faulty-Degree (EFD) certificate is a subgraph $H \subseteq G$ with the following guarantee: For any subset $F \subseteq E$ with $deg(F)\leq f$ and every pair $u,v \in V$, $u$ and $v$ are connected in $H - F$ iff they are connected in $G - F$. For example, a $1$-EFD certificate preserves connectivity under the failing of any matching edge set $F$ (hence, possibly $|F|=Θ(n)$). In their work, [BHP'24] presented an expander-based approach (e.g., using the tools of expander decomposition and expander routing) for computing $f$-EFD certificates with $O(f n \cdot poly(\log n))$ edges. They also provided a lower bound of $Ω(f n\cdot \log_f n)$, hence $Ω(n\log n)$ for $f=O(1)$. In this work, we settle the optimal existential size bounds for $f$-EFD certificates (up to constant factors), and also extend it to support vertex failures with bounded degrees (where each vertex is incident to at most $f$ faulty vertices). Specifically, we show that for every $n>f/2$, any $n$-vertex graph admits an $f$-EFD (and $f$-VFD) certificates with $O(f n \cdot \log(n/f))$ edges and that this bound is tight. Our upper bound arguments are considerably simpler compared to prior work, do not use expanders, and only exploit the basic structure of bounded degree edge and vertex cuts.

Connectivity Certificate against Bounded-Degree Faults: Simpler, Better and Supporting Vertex Faults

TL;DR

This work settles the optimal existential size bounds for -EFD certificates (up to constant factors), and extends it to support vertex failures with bounded degrees (where each vertex is incident to at most faulty vertices).

Abstract

An -edge (or vertex) connectivity certificate is a sparse subgraph that maintains connectivity under the failure of at most edges (or vertices). It is well known that any -vertex graph admits an -edge (or vertex) connectivity certificate with edges (Nagamochi and Ibaraki, Algorithmica 1992). A recent work by (Bodwin, Haeupler and Parter, SODA 2024) introduced a new and considerably stronger variant of connectivity certificates that can preserve connectivity under any failing set of edges with bounded degree. For every -vertex graph and a degree threshold , an -Edge-Faulty-Degree (EFD) certificate is a subgraph with the following guarantee: For any subset with and every pair , and are connected in iff they are connected in . For example, a -EFD certificate preserves connectivity under the failing of any matching edge set (hence, possibly ). In their work, [BHP'24] presented an expander-based approach (e.g., using the tools of expander decomposition and expander routing) for computing -EFD certificates with edges. They also provided a lower bound of , hence for . In this work, we settle the optimal existential size bounds for -EFD certificates (up to constant factors), and also extend it to support vertex failures with bounded degrees (where each vertex is incident to at most faulty vertices). Specifically, we show that for every , any -vertex graph admits an -EFD (and -VFD) certificates with edges and that this bound is tight. Our upper bound arguments are considerably simpler compared to prior work, do not use expanders, and only exploit the basic structure of bounded degree edge and vertex cuts.

Paper Structure

This paper contains 11 sections, 6 theorems, 2 equations, 2 figures, 1 algorithm.

Table of Contents

  1. Introduction
  2. Related Notion: Faulty-Degree Spanners.
  3. Our Contribution
  4. Our Approach
  5. The Blocking-Set Method.
  6. New: Blocking Bounded-Degree Cuts for MFD Certificates.
  7. Computational Aspects.
  8. Upper Bound for Mixed Faults
  9. Lower Bound for $f$-EFD Certificates
  10. A Remark on Multigraphs.
  11. Open Ends.

Key Result

Theorem 1.3

For all positive integers $n>f$, every simple $n$-vertex graph has an $f$-MFD connectivity certificate with $O(\min\{fn \log (n/f),n^2\})$ edges.

Figures (2)

  • Figure 1: Shown is a $3$-MFD set $F=\{(v,a),(v,c),b\}$, where vertex $v$ is incident to three faults.
  • Figure 2: The lower bound graph is formed by taking the hypercube and replacing each vertex replaced by $f$ vertices, and each edge by an $f\times f$ biclique. In the figure $f=3$, every transparent edge $e$ in the right cube represents a $3 \times 3$ biclique.

Theorems & Definitions (17)

  • Definition 1.1: Edge-Faulty-Degree (EFD) Connectivity Certificates,BodwinHP24
  • Definition 1.2: MFD Connectivity Certificates
  • Theorem 1.3: Main Result
  • Theorem 1.4: Lower Bound for EFD Certificates
  • Definition 2.1: Damaging an Edge
  • Definition 2.2: Connectivity Blocking Sets
  • proof
  • Definition 2.4: MFD Connectivity Blocking Set
  • Lemma 2.5: MFD blocking set is hereditary
  • proof
  • ...and 7 more