A Study on Algorithms for Calculating the k-Maximum Capacity Paths in a Network

K-최대용량경로(最大容量經路) 계산법(計算法)에 관한 연구(硏究)

Methods for calculating k shortest paths in a network system, are based on a analogy which exists between the solution of a network problem and traditional techniques for solving linear equations. This paper modifies an algebraic structure of the K shortest path method and develops k maximum flow methods. On the basis of both theoretical and algebraic structure, three iteration methods are developed and the effective procedure of each method are provided. Finally, computational complexity is discussed for those methods.