Minimum Spanning Tree Problems with Possibilistic Arc Weights and their Single Most Vital Arcs
碩士 === 南台科技大學 === 工業管理研究所 === 97 === When the arc weights are fuzzy numbers, the total weight of a spanning tree is also a fuzzy number. Since the number of spanning trees in a network is usually very large, how to select a spanning tree is an interesting problem. In this study, based on the possibi...
Main Authors: | Hui-Hsin Hsu, 許惠馨 |
---|---|
Other Authors: | Kao-Cheng Lin |
Format: | Others |
Language: | zh-TW |
Published: |
2009
|
Online Access: | http://ndltd.ncl.edu.tw/handle/59445356038175304316 |
Similar Items
-
Minimum spanning tree problems with fuzzy arc weights
by: Kai-Nien-Teng, et al.
Published: (2007) -
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) -
Self-stabilizing algorithm - Finding the most vital edge in the minimum spanning tree
by: Chi-Yuan Lo, et al.
Published: (2008) -
Empirical Studies on Remote Minimum Weight Spanning Tree Problem
by: Chun-Yuan Tsai, et al.
Published: (2006)