Self-stabilizing Algorithms for the Minimal k-dominating Set Problem for k=1 or 2
博士 === 元智大學 === 資訊工程學系 === 95 === Self-stabilization is a theoretical framework of non-masking fault-tolerant distributed algorithms. The self-stabilizing property makes the algorithm capable of handling error recovery automatically. A self-stabilizing system is more robust than a traditional fault-...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/48625396289785534798 |