Accession Number:

AD0605014

Title:

ON THE MAX FLOW MIN CUT THEOREM OF NETWORKS

Descriptive Note:

Corporate Author:

RAND CORP SANTA MONICA CA

Personal Author(s):

Report Date:

1955-04-15

Pagination or Media Count:

13.0

Abstract:

It is shown that Mengers theorem and the Max Flow Min Cut Theorem on networks are applications of the duality theorem of linear inequality theory.

Subject Categories:

  • Numerical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE