Journal of the military operations research society of Korea (한국국방경영분석학회지)
- Volume 26 Issue 2
- /
- Pages.1-7
- /
- 2000
- /
- 1229-9898(pISSN)
The revised quickest path algorithm
수정된 최속경로 알고리즘
Abstract
A quickest path in a network is a path that takes the shortest time to send the amount of data from the source node to the sink node. Martin and Santos presented a theorem on the quickest path by which a quickest path for the amount of data is determined. However, we find a counterexample to Martins and Santos' theorem. In this paper, we present the corrected theorem and give a revised algorithm for finding quickest paths.
Keywords