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...

Full description

Bibliographic Details
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

id	ndltd-TW-102NTB05243019
record_format	oai_dc
spelling	ndltd-TW-102NTB052430192017-05-20T04:29:59Z http://ndltd.ncl.edu.tw/handle/58521198248003897516 Listing All Minimum Spanning Trees in an Undirected Graph Using MapRedcue 利用 MapReduce 架構列舉最小生成樹 Hung-Wei Tsai 蔡宏偉碩士國立臺北商業技術學院資訊與決策科學研究所 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 based on MapRedcue, which uses multiple computers to parallelly process the computation. The performance of applying MapReduce on the enumeration problem is evaluated through experiments. Hung-Lung Wang 王弘倫 2014 學位論文 ; thesis 46 zh-TW
collection	NDLTD
language	zh-TW
format	Others
sources	NDLTD
description	碩士 === 國立臺北商業技術學院 === 資訊與決策科學研究所 === 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 based on MapRedcue, which uses multiple computers to parallelly process the computation. The performance of applying MapReduce on the enumeration problem is evaluated through experiments.
author2	Hung-Lung Wang
author_facet	Hung-Lung Wang Hung-Wei Tsai 蔡宏偉
author	Hung-Wei Tsai 蔡宏偉
spellingShingle	Hung-Wei Tsai 蔡宏偉 Listing All Minimum Spanning Trees in an Undirected Graph Using MapRedcue
author_sort	Hung-Wei Tsai
title	Listing All Minimum Spanning Trees in an Undirected Graph Using MapRedcue
title_short	Listing All Minimum Spanning Trees in an Undirected Graph Using MapRedcue
title_full	Listing All Minimum Spanning Trees in an Undirected Graph Using MapRedcue
title_fullStr	Listing All Minimum Spanning Trees in an Undirected Graph Using MapRedcue
title_full_unstemmed	Listing All Minimum Spanning Trees in an Undirected Graph Using MapRedcue
title_sort	listing all minimum spanning trees in an undirected graph using mapredcue
publishDate	2014
url	http://ndltd.ncl.edu.tw/handle/58521198248003897516
work_keys_str_mv	AT hungweitsai listingallminimumspanningtreesinanundirectedgraphusingmapredcue AT càihóngwěi listingallminimumspanningtreesinanundirectedgraphusingmapredcue AT hungweitsai lìyòngmapreducejiàgòulièjǔzuìxiǎoshēngchéngshù AT càihóngwěi lìyòngmapreducejiàgòulièjǔzuìxiǎoshēngchéngshù
_version_	1718449710456373248

Listing All Minimum Spanning Trees in an Undirected Graph Using MapRedcue

Similar Items