Title :
Maximum flow in a communication network
Author :
Bapeswara Rao, V.V. ; Sankara Rao, K. ; Sankaran, Praveen ; 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 all segregations that disconnect i and j, an algorithm based on the binary form of natural numbers is presented.
Keywords :
Charge carrier lifetime; Communication networks; Equations; Motion measurement; P-n junctions; Photovoltaic systems; Probes; Solar power generation; Solids; Telecommunications;
Journal_Title :
Proceedings of the IEEE
DOI :
10.1109/PROC.1968.6201
