Efficient algorithms for the problems of enumerating cuts by non-decreasing weights (Q848944)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient algorithms for the problems of enumerating cuts by non-decreasing weights |
scientific article; zbMATH DE number 5674323
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for the problems of enumerating cuts by non-decreasing weights |
scientific article; zbMATH DE number 5674323 |
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
0 references
0 references
0.9503339529037476
0 references
0.8657755851745605
0 references
0.8205395340919495
0 references
