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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / author
 
Property / author: Sumit K. Garg / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C80 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q87 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6375645 / rank
 
Normal rank
Property / zbMATH Keywords
 
reliability polynomial
Property / zbMATH Keywords: reliability polynomial / rank
 
Normal rank
Property / zbMATH Keywords
 
fully-polynomial relative approximation scheme
Property / zbMATH Keywords: fully-polynomial relative approximation scheme / rank
 
Normal rank
Property / zbMATH Keywords
 
FPRAS
Property / zbMATH Keywords: FPRAS / rank
 
Normal rank
Property / zbMATH Keywords
 
network reliability
Property / zbMATH Keywords: network reliability / rank
 
Normal rank
Property / zbMATH Keywords
 
sequential importance sampling
Property / zbMATH Keywords: sequential importance sampling / rank
 
Normal rank
Property / zbMATH Keywords
 
online algorithm
Property / zbMATH Keywords: online algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
incremental algorithm
Property / zbMATH Keywords: incremental algorithm / rank
 
Normal rank

Revision as of 18:03, 30 June 2023

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