Self-stabilizing algorithm for the shortest detour problem in biconnected graph
碩士 === 國立臺灣科技大學 === 資訊管理系 === 95 === In this thesis, we propose a self-stabilizing algorithm for the shortest detour problem assuming the distributed demon in biconnected graph. We call a system self-stabilizing if regardless of the initial state the system will return to legitimate state after fini...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/389k5z |