An Incremental Distributed Minimum Directed Spanning Tree Algorithm

S. Liu, D. Epley, and W. Decker (USA)


Algorithm, distributed environments, directed graph.


An incremental distributed algorithm is presented that maintains a minimum directed spanning tree when new nodes are added into the graph. The algorithm modifies the existing tree to accommodate a new node so that the resulting tree is still optimal, instead of constructing the tree from the scratch.

Important Links:

Go Back