An Identification Method of All Minimum-Cuts in the Maximum-Flow Problem

IR (HANDLE) Web Site Open Access

Bibliographic Information

Other Title
  • 最大フロー問題における全最小カット特定の一方法

Search this article

Description

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.

Journal

Keywords

Details 詳細情報について

Report a problem

Back to top