Naval Postgraduate School
Computation of maximum flows in networks
computationofmax00burn.pdf (2.215Mb)Abstract
A review of the current theory and methods for the computation
of maximum flow in networks is presented along with a simplified
method for determination of a feasible flow in networks with upper
and lower bounded arcs. A computational procedure is presented which
is used to calculate the maximum flow for a general network. The
network is reduced to an equivalent basic network. An associated
network is used to compute a feasible, then the maximum flow for
the basic network. A computer program is included for use in
computation of maximal flows in large networks.
Collections
Related items
Showing items related by title, author, creator and subject.
-
Efficiently interdicting a time-expanded transshipment network
(Monterey, California. Naval Postgraduate School, 1997-09);A network interdictor' has a limited supply of resource with which to disrupt a network user's" flow of supplies in a capacitated transshipment network. The interdictor's problem of minimizing the maximum flow through the ... -
Safe Update of Hybrid SDN Networks
(IEEE, 2017-06);The support for safe network updates, i.e., live modification of device behavior without service disruption, is a critical primitive for current and future networks. Several techniques have been proposed by previous works ... -
Static reachability analysis and validation regarding security policies implemented via packet filters
(Monterey, California. Naval Postgraduate School, 2007-03);The ability to statically determine what kinds of packets can be exchanged between two hosts on a network is desirable to those who design and operate networks, but this is a difficult and complex problem. Factors affecting ...
