分散式平行環境中的最大流演算法評比
碩士 === 國立清華大學 === 資訊工程學系 === 102 === The maximum flow problem is one of the most basic problems in network flow theory. Many single-machine sequential algorithms are proposed over the years. However, distributed environments are much more common nowadays. In this thesis, our focus is to compute maxi...
Main Authors: | Wu, Po-Chun, 吳柏醇 |
---|---|
Other Authors: | 韓永楷 |
Format: | Others |
Language: | en_US |
Published: |
2014
|
Online Access: | http://ndltd.ncl.edu.tw/handle/13416239934216554902 |
Similar Items
-
適合分散式與平行式處理的RASTERTOVECTOR演算法設計
by: CAI, MING-HONG, et al.
Published: (1989) -
在分散式環境上之PROLOG平行處理系統
by: XIAO, XUN-JIE, et al.
Published: (1989) -
STEINER 問題的分散式演算法之研究
by: GUO, MING-DE, et al.
Published: (1989) -
平行/分散式系統之網路通訊工具設計與製作
by: 劉育城
Published: (2001) -
以平行分散處理糢式建立股市預測知識庫
by: WANG,QUE-XIANG, et al.
Published: (1990)