分散式平行環境中的最大流演算法評比
碩士 === 國立清華大學 === 資訊工程學系 === 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: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/13416239934216554902 |