Sciweavers

11 search results - page 3 / 3
» Phase Transitions on Fixed Connected Graphs and Random Graph...
Sort
View
PODC
2005
ACM
13 years 11 months ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder