A novel minimal cut-based algorithm to find all minimal capacity vectors for multi-state flow networks (Q2286903)
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 7156883
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A novel minimal cut-based algorithm to find all minimal capacity vectors for multi-state flow networks |
scientific article; zbMATH DE number 7156883 |
Statements
A novel minimal cut-based algorithm to find all minimal capacity vectors for multi-state flow networks (English)
0 references
23 January 2020
0 references
reliability
0 references
\(d\)-MP
0 references
minimal cuts
0 references
multi-state flow network
0 references
parallel computing
0 references
0 references
0 references
0 references
0 references
0 references
0.8525307178497314
0 references
0.8425520062446594
0 references
0.8344835638999939
0 references
0.8139726519584656
0 references
