Efficient algorithms for the problems of enumerating cuts by non-decreasing weights (Q848944): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:41, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for the problems of enumerating cuts by non-decreasing weights |
scientific article |
Statements
Efficient algorithms for the problems of enumerating cuts by non-decreasing weights (English)
0 references
23 February 2010
0 references
algorithms
0 references
graphs
0 references
minimum cuts
0 references
maximum flows
0 references
suboptimal cuts
0 references
enumeration
0 references
