Duality and the maximal flow capacity of a general network
By: by Alan W. McMasters
Contributors: Naval Postgraduate School (U.S.)
Publisher: Naval Postgraduate School
Published: 1971
Place of publication: Monterey, California
Language: eng
Number of pages: 38
Subjects: Linear programming; Network analysis (Planning); Operations research
Description: The use of the dual graph in determining the maximal flow capacity of an undirected source-sink planar network has been extended to general networks. A directed dual graph is first defined for directed source-sink planar networks such that the length of the shortest route through this dual is equal to the maximal flow capacity of the primal. The construction of the dual is then modified to handle flows in networks which are not source-sink planar. An algorithm is presented for finding the modified shortest route through this dual having a length equal to the maximal flow capacity of the primal network.
Notes: Title from cover.

"27 December 1971"--Cover.

"NPS55MG71121A"--Cover.

DTIC Identifiers: Network flows, graphs, duality theory.

Includes bibliographical references (p. 34).

"Approved for public release; distribution unlimited"--Cover.

Technical report; 1971.

32768001622251 missing in inventory, no repl. 3/18/93 per rm.  11/18/93 mw

ck/ 9/22/09.