Paper. Australian Journal of Basic and Applied Sciences, pp. 3771-3777, 2009 ISSN: 1991-8178 In studing many network flow problems, such as stochastic capacities and evaluating network flow reliability, the minimal paths and cuts are the essential concepts. In this paper we will develop an algorithm to determine the minimal paths in an acyclic network. Then the algorithm is...
Комментарии