Options
Maximum Flow in a Communication Network
Date Issued
01-01-1968
Author(s)
Bapeswara Rao, V. V.
Sankara Rao, K.
Sankaran, P.
Murti, V. G.K.
Abstract
The “max-flow min-cut” theorem is used to determine the maximum flow from vertex i to vertix j IN a communication network. To generate ail segregations that disconnect i and j, an algorithm based on the binary form of natural numbers is presented. Copyright © 1968 by The Institute of Electrical and Electronics Engineers, Inc.
Volume
56