Fast sequential importance sampling to estimate the graph reliability polynomial (Q476443)
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: Fast sequential importance sampling to estimate the graph reliability polynomial |
scientific article; zbMATH DE number 6375645
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast sequential importance sampling to estimate the graph reliability polynomial |
scientific article; zbMATH DE number 6375645 |
Statements
Fast sequential importance sampling to estimate the graph reliability polynomial (English)
0 references
2 December 2014
0 references
reliability polynomial
0 references
fully-polynomial relative approximation scheme
0 references
FPRAS
0 references
network reliability
0 references
sequential importance sampling
0 references
online algorithm
0 references
incremental algorithm
0 references
0 references
0.9263105392456056
0 references
0.8105155825614929
0 references
0.8052111268043518
0 references
