Abstract
The spanning tree maintenance problem for an LAN model in which node processors may halt and recover is considered. An algorithm meeting the conditions that the spanning tree is an L-ary complete tree and that nodes halt or recover singly is presented. The message complexity of this algorithm is shown to be comparable with local computational complexity
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call