Algorithm Design for Disjoint Path Problem
Zhi Chen · Jisuanji gongcheng · 2013
For finding the number of alternative routings in the network,this paper presents a new question of disjoint path,that is how to find the largest number of disjoint paths which exist at the same time in the network.And aiming at selecting the optimal route,consider the problem of getting K(K is an integer and K1) disjoint paths,whose total weights are least.In addition,find the relation between the disjoint paths and the network flow and prove it.Benefiting from the network flow,a simple algorithm is designed.The results of application show that,the algorithm’s complexity is small.The algorithm can be used to solve the problem of multi-path routing in network communication.