Graph spanners: A tutorial review
This survey provides a guiding reference to researchers seeking an overview of the large
body of literature about graph spanners. It surveys the current literature covering various …
body of literature about graph spanners. It surveys the current literature covering various …
Towards a unified theory of sparsification for matching problems
S Assadi, A Bernstein - arXiv preprint arXiv:1811.02009, 2018 - arxiv.org
In this paper, we present a construction of amatching sparsifier', that is, a sparse subgraph of
the given graph that preserves large matchings approximately and is robust to modifications …
the given graph that preserves large matchings approximately and is robust to modifications …
Nearly optimal vertex fault-tolerant spanners in optimal time: sequential, distributed, and parallel
M Parter - Proceedings of the 54th Annual ACM SIGACT …, 2022 - dl.acm.org
We (nearly) settle the time complexity for computing vertex fault-tolerant (VFT) spanners with
optimal sparsity (up to polylogarithmic factors). VFT spanners are sparse subgraphs that …
optimal sparsity (up to polylogarithmic factors). VFT spanners are sparse subgraphs that …
Optimal vertex fault-tolerant spanners in polynomial time
Recent work has pinned down the existentially optimal size bounds for vertex fault-tolerant
spanners: for any positive integer k, every n-node graph has a (2 k–1)-spanner on O (f 1 …
spanners: for any positive integer k, every n-node graph has a (2 k–1)-spanner on O (f 1 …
Bridge girth: A unifying notion in network design
G Bodwin, G Hoppenworth… - 2023 IEEE 64th Annual …, 2023 - ieeexplore.ieee.org
A classic 1993 paper by Althöfer et al. proved a tight reduction from spanners, emulators,
and distance oracles to the extremal function γ of high-girth graphs. This paper initiated a …
and distance oracles to the extremal function γ of high-girth graphs. This paper initiated a …
Efficient and simple algorithms for fault-tolerant spanners
It was recently shown that a version of the greedy algorithm gives a construction of fault-
tolerant spanners that is size-optimal, at least for vertex faults. However, the algorithm to …
tolerant spanners that is size-optimal, at least for vertex faults. However, the algorithm to …
Faster replacement paths and distance sensitivity oracles
F Grandoni, VV Williams - ACM Transactions on Algorithms (TALG), 2019 - dl.acm.org
Shortest paths computation is one of the most fundamental problems in computer science.
An important variant of the problem is when edges can fail, and one needs to compute …
An important variant of the problem is when edges can fail, and one needs to compute …
A trivial yet optimal solution to vertex fault tolerant spanners
A Trivial Yet Optimal Solution to Vertex Fault Tolerant Spanners Page 1 A Trivial Yet Optimal
Solution to Vertex Fault Tolerant Spanners Greg Bodwin gbodwin6@cc.gatech.edu Georgia …
Solution to Vertex Fault Tolerant Spanners Greg Bodwin gbodwin6@cc.gatech.edu Georgia …
Labeled nearest neighbor search and metric spanners via locality sensitive orderings
A Filtser - arXiv preprint arXiv:2211.11846, 2022 - arxiv.org
Chan, Har-Peled, and Jones [SICOMP 2020] developed locality-sensitive orderings (LSO)
for Euclidean space. A $(\tau,\rho) $-LSO is a collection $\Sigma $ of orderings such that for …
for Euclidean space. A $(\tau,\rho) $-LSO is a collection $\Sigma $ of orderings such that for …
Partially optimal edge fault-tolerant spanners
Recent work has established that, for every positive integer k, every n-node graph has a (2 k–
1)-spanner with O (f 1–1/kn 1+ 1/k) edges that is resilient to f edge or vertex faults. For vertex …
1)-spanner with O (f 1–1/kn 1+ 1/k) edges that is resilient to f edge or vertex faults. For vertex …