ComputingComputer EngineeringComputer ScienceFault ToleranceFault-tolerant ComputingFault-tolerant SystemsFault ModelingFault Tolerance DesignNetwork Fault ToleranceNetwork ReliabilityReliable Distributed SystemsReliable System DesignDistributed Data StructuresFault Tolerant AlgorithmsFault-tolerant Distributed SystemsFault-tolerant Network DesignFault-tolerant NetworksRandom Graphs
A natural requirement for many distributed structures is fault-tolerance: after some failures in the underlying network, whatever remains from the structure should still be effective for whatever remains from the network. In this paper we examine spanners of general graphs that are tolerant to vertex failures, and significantly improve their dependence on the number of faults r for all stretch bounds.
28
Noga Alon, Raphael Yuster, Uri Zwick · Journal of the ACM · 1995 · 1K citations · Full text
Probabilistic approximation of metric spaces and its algorithmic applications
Y. Bartal · 2002 · 656 citations
Mikkel Thorup, Uri Zwick · Journal of the ACM · 2005 · 618 citations
On sparse spanners of weighted graphs
Ingo Althöfer, Gautam Das, David Dobkin et al. · Discrete & Computational Geometry · 1993 · 600 citations · Full text