A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem (Q2753004)
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 randomized fully polynomial time approximation scheme for the all-terminal network reliability problem |
scientific article; zbMATH DE number 1666047
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem |
scientific article; zbMATH DE number 1666047 |
Statements
23 October 2001
0 references
network reliability
0 references
approximation scheme
0 references
minimum cut
0 references
A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem (English)
0 references
