Learn More
We study the problem of conducting a global survey in faulty networks. The problem, abbreviated as GSP, can be considered as an extension on that of network broadcasting. We show that the time complexity lower bound for GSP is n(lVI) and the message complexity is R(min(lVI,k)lVI+IEI) where k is the number of links failed. While there is a straightforward(More)
  • 1