Fast sequential importance sampling to estimate the graph reliability polynomial (Q476443): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 04:49, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Fast sequential importance sampling to estimate the graph reliability polynomial |
scientific article |
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