Broadcasting with random faults

https://doi.org/10.1016/0166-218X(88)90037-6Get rights and content
Under an Elsevier user license
open archive

Abstract

We consider the problem of broadcasting in an n-vertex graph a message that originates from a given vertex, in the presence of random edge faults. If the number of edge faults is at most proportional to the total number of edges, there are networks for which the broadcast can be done in time O(log n), with high probability.

Cited by (0)