Alternative approach on minimization problem by graph theory

Abstract

A randomized parallel linked residual network Gr =(V'£j) is presented. Algorithmically the residual network, which produces successive shortest path distances and the original graph G=(V,E) is solved. This result is optimum with respect to both addition of flow and transferring of flow in path flow of the residual net\••o..rk. Depth First Search (DFS) techniques can calculate both the shortest path distances and time stamps. Thus non-linear complementarity problcm can be reformulated as a shortest path distances.