The revised quickest path algorithm

수정된 최속경로 알고리즘

  • 이상욱 (서울대학교 산업공학과) ;
  • 박찬규 (한국전산원 정보화 평가분석단) ;
  • 박순달 (서울대학교 산업공학과)
  • Published : 2000.12.01

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