Computational complexity of impact size estimation for spreading processes on networks (Q977764): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Marco Laumanns / rank
 
Normal rank
Property / author
 
Property / author: Rico Zenklusen / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1972648348 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reaction-diffusion processes and epidemic metapopulation models in complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the critical behavior of the general epidemic process and dynamical percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of network reliability computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Reliability Computations in Planar and Acyclic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thresholds for virus spread on networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the Size and Probability of Epidemics on Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting over non-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for Monte Carlo Estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Reduction of Two-Terminal Directed Acyclic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Delta-Wye Approximation Procedure for Two-Terminal Reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network reliability and the probabilistic estimation of damage from fire spread / rank
 
Normal rank
Property / cites work
 
Property / cites work: Renormalization of two—terminal reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monte-Carlo algorithms for the planar multiterminal network reliability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Computing <i>K</i>-Terminal Reliability in Series-Parallel Networks / rank
 
Normal rank

Latest revision as of 23:18, 2 July 2024

scientific article
Language Label Description Also known as
English
Computational complexity of impact size estimation for spreading processes on networks
scientific article

    Statements

    Computational complexity of impact size estimation for spreading processes on networks (English)
    0 references
    23 June 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    justifications or modifications of Monte Carlo methods
    0 references
    networks
    0 references
    computational complexity
    0 references
    complex systems
    0 references
    0 references
    0 references
    0 references