A new saling algorithm for the maximum mean cut problem (Q1317477): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:03, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new saling algorithm for the maximum mean cut problem |
scientific article |
Statements
A new saling algorithm for the maximum mean cut problem (English)
0 references
17 April 1994
0 references
maximum mean
0 references
scaling algorithm
0 references
circulation feasibility
0 references
minimum-cost circulation
0 references
binary search
0 references
