Construction of maximal dynamic flows in networks.

Construction of maximal dynamic flows in networks.

Regular price $15.00 $12.00 Sale

A description of an algorithm for solving the problem of finding a maximal dynamic flow through a network. A network is considered in which each link has associated with it two positive integers. It is assumed that some node of the network is a sourc...