Art

J-GLOBAL ID：201602248568058692   Reference number：16A1312494

The Simplest and Smallest Network on Which the Ford-Fulkerson Maximum Flow Procedure May Fail to Terminate

Ford-Fulkerson最大流手順が停止に失敗する最も単純かつ小さいネットワーク

Author (1)： Takahashi Toshihiko (Institute of Natural Science and Technology, Academic Assembly, Niigata University)
Material： Journal of Information Processing (Web)  (J Inf Proc (Web))
Volume： 24  Issue： 2  Page： 390-394(J-STAGE)  Publication year： 2016 
JST Material Number： U0109A  ISSN： 1882-6652  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： *maximum flow problem ,  *algorithm ,  *path ,  *continued fraction ,  Euclidean space ,  theorem ,  case study ,  labeling method ,  rational number ,  network ,  integral ,  vertex ,  edge ,  stopping problem
Semi thesaurus term： Ford-Fulkersonアルゴリズム ,  流れ拡大経路 ,  無限連分数 ,  network flow

Author keywords (4)： maximum flow ,  Ford-Fulkerson algorithm ,  flow augmenting path ,  infinite continued fraction

JST classification (2)： Network methods  (KA03040X) ,  Theory of computation  (JB02000A)

Reference (16)：

• [1] Ford, L.R. and Fulkerson, D.R.: Flows in Networks, Princeton University Press (1962).
• [2] Dinic, E.A.: Algorithm for solution of a problem of maximum flow in a network with power estimation, Soviet Mathematics Doklady, Vol.11, pp.1277-1280 (1970).
• [3] Takagi, T.: Elementary Number Theory Lecture - Second Edition, Kyoritsu Shuppan Co., Ltd. (1971) (in Japanese).
• [4] Edmonds, J. and Karp, R.M.: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems, Journal of the Association for Computing Machinery, Vol.19, pp.248-264 (1972).
• [5] Lawler, E.L.: Combinatorial Optimization: Networks and Matroid, Holt, Rinehart and Winston (1976).

Terms in the title (2)： 手順 ,  失敗