![Sample our Engineering & Technology journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5933/TOC-Subject-Sample-2021-Engineering-Tech.jpg"})
Abstract
Implications of different modifications in a traffic network (modifications of capacities of arcs, adding of new arcs), upon the total value of the maximum flow in the network, are studied in this paper by means of the algorithm for the maximum flow [1] described in the annex.
The study being based upon the notion of network cut, the way to determine all minimal cuts in a network is the first to be presented. How these minimal cuts can be of help when sensitive and parametric analysis is made, is shown next, for problems of maximum flow.