A Space Optimal, Self-stabilizing Algorithm for Constructing Spanning Trees
碩士 === 國立清華大學 === 資訊工程學系 === 91 === Tree construction problem is always an interesting topic under fault-tolerant distributed systems. In this thesis, we present a deterministic self-stabilizing spanning tree construction algorithm, which runs in a non-uniform network with general graph t...
Main Authors: | Chi-Hung Tzeng, 曾志宏 |
---|---|
Other Authors: | Thing-Tsaan Huang |
Format: | Others |
Language: | zh-TW |
Published: |
2003
|
Online Access: | http://ndltd.ncl.edu.tw/handle/70871353916806951811 |
Similar Items
-
Time optimal self-stabilizing spanning tree algorithms
by: Aggarwal, Sudhanshu Madan
Published: (2007) -
Self-stabilizing algorithm - Finding the most vital edge in the minimum spanning tree
by: Chi-Yuan Lo, et al.
Published: (2008) -
Construction of an optimal spanning tree as a tool to ensure the stability of the communication network
by: B.F. Mel'nikov, et al.
Published: (2021-03-01) -
Self-Stabilizing Coloring Algorithms
by: Tseng, Chih-Hung, et al.
Published: (2009) -
Utilizing the Maximum Spanning Tree to Construct Stability-based Routes in Self-driving Vehicular Networks
by: Hao-ZeJheng, et al.
Published: (2017)