An efficient method to solve least-cost minimum spanning tree (LC-MST) problem

Efficient distributed algorithm to solve

Efficient distributed algorithm to solve updating minimum spanning tree problem

✍ Jungho Park; Ken'Ichi Hagihara; Nobuki Tokura; Toshimitsu Masuzawa 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 983 KB

## Abstract This paper proposes a distributed algorithm for reconstructing a minimum‐weight spanning tree __T__′ of a network __N__′ when link addition and deletion occur in a network __N__ with a minimum‐weight spanning tree __T.__ In this algorithm each processor uses information whose adjacent l