On the single-source shortest paths problem in dynamic environments
碩士 === 元智大學 === 資訊工程學系 === 102 === The single-source shortest paths problem finds those paths which are between source node and each node in a graph when the sum of weights in edges on those paths is minimized. Assume that in each phase, a new weight, produced by a random distribution, is given to e...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Online Access: | http://ndltd.ncl.edu.tw/handle/40464826756951298695 |