Self-stabilizing algorithm - Finding the most vital edge in the minimum spanning tree
碩士 === 國立臺灣科技大學 === 資訊管理系 === 96 === Finding the most vital edge problem in a minimum spanning tree is to calculate the vital number of every nodes. If the vital value of node i is the largest one, then the tree-edge connected by this node and its parent is the most vital edge[13]. In order to find...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/93195855277568624086 |