Finding the Most Vital Edge of a Shortest-Paths Tree
碩士 === 國立臺灣大學 === 資訊工程學研究所 === 96 === Since the development of computers and the expediency of internet, network plays an important role in the life of human beings. If there is only one computer as the server, then we use a single-source shortest-paths tree to connect the network. Maybe some line o...
Main Authors: | Wei-Yang Chen, 陳韋仰 |
---|---|
Other Authors: | 趙坤茂 |
Format: | Others |
Language: | en_US |
Published: |
2008
|
Online Access: | http://ndltd.ncl.edu.tw/handle/62726306826653756285 |
Similar Items
-
Solving the Longest Detour and Most Vital Edge Problems of a Shortest Path
by: Chien-Yi Li, et al.
Published: (2008) -
Self-stabilizing algorithm - Finding the most vital edge in the minimum spanning tree
by: Chi-Yuan Lo, et al.
Published: (2008) -
Finding the most vital edge with respect to minimum spanning trees in weighted graphs
by: JIN, DIAO-MING, et al.
Published: (1992) -
Finding the most vital edge with respect to minimum spanning tree in weighted graphs
by: LI,YU-QI, et al.
Published: (1991) -
ALGORITHMS FOR FINDING THE MOST VITAL EDGE ON CERTAIN NETWORK PROBLEMS
by: Wang, Peng-Fei, et al.
Published: (1995)