Maximal Flow Through a Network
This paper is under a licence that does not allow it to be reproduced, so what is here is its front matter and a short abstract. Read it at the publisher's page.
日本語
English
ネットワークを通る最大フロー
「2つの都市を多数の中間都市を経由して接続する鉄道ネットワークを考える。ネットワークの各リンクには、その容量を表す数値が割り当てられている。定常状態を仮定し、ある指定された都市からもう一方の都市への最大フローを求めよ。」
This section is missing here.
L. R. Ford, Jr. and D. R. Fulkerson
References
- G. B. Dantzig, *Maximization of a linear function of variables subject to linear inequalities: Activity analysis of production and allocation* (Cowles Commission, 1951).
- H. Whitney, *Non-separable and planar graphs*, Trans. Amer. Math. Soc., *34* (1932), 339–362.
- ———, *Planar graphs*, Fundamenta Mathematicae, *21* (1933), 73–84. Rand Corporation, Santi Monica, California
Read off the page by a vision model reading the page images using olmOCR-2-7B-1025-FP8. Translated into 日本語 by gpt-5, against glossary version 6. Translated from the English.
Read off the page by a vision model reading the page images using olmOCR-2-7B-1025-FP8.