A new approach for computing a most positive cut using the minimum flow algorithms (Q2493746)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5033029
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new approach for computing a most positive cut using the minimum flow algorithms |
scientific article; zbMATH DE number 5033029 |
Statements
A new approach for computing a most positive cut using the minimum flow algorithms (English)
0 references
16 June 2006
0 references
A theorem that expresses the relation between the most positive cut problem and the minimum flow problem is proved, and a new algorithm to solve the most positive cut problem using the minimum flow algorithms is presented. The algorithm runs in the running time of the minimum flow algorithm. A theorem showing that the feasibility of a network can be distinguished by solving a minimum flow problem is proved.
0 references
network flow
0 references
minimum flow
0 references
most positive cut
0 references
algorithm
0 references
0 references
0 references
0 references
0.8155626654624939
0 references
0.8052611947059631
0 references
0.8052611947059631
0 references
0.7919208407402039
0 references
0.7916730046272278
0 references
