A Trivial Yet Optimal Solution to Vertex Fault Tolerant Spanners

12/14/2018
by   Greg Bodwin, et al.
0

We give a short and easy upper bound on the worst-case size of fault tolerant spanners, which improves on all prior work and is fully optimal at least in the setting of vertex faults (even without assuming the girth conjecture).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/26/2020

A Polynomial Time Algorithm for Almost Optimal Vertex Fault Tolerant Spanners

We present the first polynomial time algorithm for the f vertex fault to...
research
07/16/2020

Optimal Vertex Fault-Tolerant Spanners in Polynomial Time

Recent work has pinned down the existentially optimal size bounds for ve...
research
09/16/2021

Vertex Fault-Tolerant Emulators

A k-spanner of a graph G is a sparse subgraph that preserves its shortes...
research
03/14/2019

Fault Tolerant Network Constructors

In this work we examine what graphs (networks) can be stably and distrib...
research
09/07/2022

Õptimal Vertex Fault-Tolerant Spanners in Õptimal Time: Sequential, Distributed and Parallel

We (nearly) settle the time complexity for computing vertex fault-tolera...
research
10/04/2020

Distributed Constructions of Dual-Failure Fault-Tolerant Distance Preservers

Fault tolerant distance preservers (spanners) are sparse subgraphs that ...
research
10/03/2018

Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient

We present an algorithm for a fault tolerant Depth First Search (DFS) Tr...

Please sign up or login with your details

Forgot password? Click here to reset