Fast sequential importance sampling to estimate the graph reliability polynomial (Q476443): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-012-9703-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1981755798 / rank
 
Normal rank

Revision as of 18:51, 19 March 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
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references