A novel minimal cut-based algorithm to find all minimal capacity vectors for multi-state flow networks (Q2286903): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q126846067, #quickstatements; #temporary_batch_1722364966119 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q126846067 / rank | |||
Normal rank | |||
Latest revision as of 19:54, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A novel minimal cut-based algorithm to find all minimal capacity vectors for multi-state flow networks |
scientific article |
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
