Construction of maximal dynamic flows in networks.
$15.00
{{option.name}}:
{{selected_options[option.position]}}
{{value_obj.value}}
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...
Show More
Show Less