Article ID: | iaor2001947 |
Country: | Japan |
Volume: | E83-A |
Issue: | 10 |
Start Page Number: | 2231 |
End Page Number: | 2236 |
Publication Date: | Oct 1999 |
Journal: | Transactions of the Institute of Electronics, Information and Communication Engineers |
Authors: | Ibaraki Toshihide, Nagamochi Hiroshi, Ishii Toshimasa |
Keywords: | networks: flow |
For the correctness of the minimum cut algorithm proposed by Nagamochi and Ibaraki, several simple proofs have been presented so far. This paper gives yet another simple proof. As a byproduct, it can provide an