Listing All Minimum Spanning Trees in an Undirected Graph Using MapRedcue
碩士 === 國立臺北商業技術學院 === 資訊與決策科學研究所 === 102 === Given an undirected graph with integral edge weights, there may be more than one minimum spanning trees. Depending on the increasing of nodes and edges, the number of minimum spanning trees may increase enormously. The enumerating algorithm in thesis is...
Main Authors: | Hung-Wei Tsai, 蔡宏偉 |
---|---|
Other Authors: | Hung-Lung Wang |
Format: | Others |
Language: | zh-TW |
Published: |
2014
|
Online Access: | http://ndltd.ncl.edu.tw/handle/58521198248003897516 |
Similar Items
-
A novel genetic algorithm based on all spanning trees of undirected graph for distribution network reconfiguration
by: Jian Zhang, et al.
Published: (2014-01-01) -
Two Algorithms for Computing All Spanning Trees of a Simple, Undirected, and Connected Graph: Once Assuming a Complete Graph
by: Maumita Chakraborty, et al.
Published: (2018-01-01) -
A Survey of Two Optimization Methods to Solve a Modified Minimal Spanning Tree Problem in Undirected Tree Graph
by: Isra Alkallak, et al.
Published: (2011-07-01) -
Balancing Minimum Spanning Trees and Multiple-Source Minimum Routing Cost Spanning Trees on Metric Graphs
by: Chung-Ming Lin, et al.
Published: (2003) -
Minimum Degree Spanning Trees on Bipartite Permutation Graphs
by: Smith, Jacqueline
Published: (2011)