A simple algorithm to search for all minimal cutsets with unreliable nodes (Q2743193)
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: A simple algorithm to search for all minimal cutsets with unreliable nodes |
scientific article; zbMATH DE number 1651739
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple algorithm to search for all minimal cutsets with unreliable nodes |
scientific article; zbMATH DE number 1651739 |
Statements
9 September 2002
0 references
source node
0 references
sink node
0 references
minimal cutsets
0 references
unreliable network
0 references
reliability
0 references
A simple algorithm to search for all minimal cutsets with unreliable nodes (English)
0 references
