Maximum Flow Finding in Fuzzy Dynamic Graph with the Given Vitality Degree

Abstract

The following paper describes the method of the maximum flow finding in fuzzy dynamic graph with the given vitality degree. The peculiarity of the problem is in fuzzy nature of the considered network and given vitality parameters assigned to arcs of the graph. Network's parameters, such as arc capacities and vitality degrees can vary over time, because they have transit character. Such methods can be applied in the real networks solving the task of the optimal cargo transportation.