Optimal Vertex Fault-Tolerant Spanners in Polynomial Time

Greg Bodwin
Greg Bodwin
Caleb Robelle
Caleb Robelle
Cited by: 0|Bibtex|Views1|Links

Abstract:

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 $(2k-1)$-spanner on $O(f^{1-1/k} n^{1+1/k})$ edges resilient to $f$ vertex faults, and there are examples of input graphs on which this bound cannot be improved. However, these pr...More

Code:

Data:

Your rating :
0

 

Tags
Comments