Counting almost minimum cutsets with reliability applications (Q3768663)
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 4027154
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting almost minimum cutsets with reliability applications |
scientific article; zbMATH DE number 4027154 |
Statements
Counting almost minimum cutsets with reliability applications (English)
0 references
1987
0 references
probabilistic graph
0 references
network reliability
0 references
inclusion-exclusion
0 references
network cutsets in a graph
0 references
minimum cardinality network cutsets
0 references
polynomial time algorithm
0 references
edge-weighted graph
0 references
reliability bounds
0 references
0 references
0 references
0 references
0 references
0.8161227703094482
0 references
0.8129908442497253
0 references
0.8104844689369202
0 references
0.808368980884552
0 references
