@article{oai:ir.kagoshima-u.ac.jp:00016225,
 author = {新森, 修一 and SHINMORI, Shuichi and 西田, 美博 and NISHIDA, Yoshihiro},
 journal = {鹿児島大学理学部紀要, Reports of the Faculty of Science, Kagoshima University},
 month = {Dec},
 note = {In this paper, it is a purpose to identify all Minimum-cuts using the solution method of Maximum-flow problem of the graph theory. Several methods and algorithms to search for the Minimum-cut has been contrived by itself already. Based on these results, we checked a relation between the edges and minimum cuts in detail, and propose about the method to specify all Minimum-cuts which aimed at the increased operation when solving the biggest flow problem. We can get the edges included in the Minimum-cut, the pair of edges which become the Minimum-cut efficiently by using this method.},
 pages = {1--9},
 title = {最大フロー問題における全最小カット特定の一方法},
 volume = {49},
 year = {2016}
}