A student proposes to omit the sending of ( nys, w ) messages from Algorithm 4. 6; he argues that a node knows that a neighbor is not a son in Tw if no ( ys, w ) message is received from that neighbor.
Is it possible to modify the algorithm in this way? What happens to the complexity of the algorithm?
Text Book: Introduction to Distributed Algorithms By Gerard Tel.