High-confidence estimation of small s -t reliabilities in directed acyclic networks (Q3087625): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1002/net.20412
@@ Property / full work available at URL: https://doi.org/10.1002/net.20412 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1987610086
@@ Property / OpenAlex ID: W1987610086 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds on two-terminal network reliability
@@ Property / cites work: Lower bounds on two-terminal network reliability / rank @@
+Normal rank
@@ Property / cites work @@
+An Optimal Algorithm for Monte Carlo Estimation
@@ Property / cites work: An Optimal Algorithm for Monte Carlo Estimation / rank @@
+Normal rank
@@ Property / cites work @@
+A Monte Carlo Sampling Plan for Estimating Network Reliability
+Normal rank
@@ Property / cites work @@
+A monte carlo sampling plan for estimating reliability parameters and related functions
+Normal rank
@@ Property / cites work @@
+A Fast Parametric Maximum Flow Algorithm and Applications
+Normal rank
@@ Property / cites work @@
+On the critical behavior of the general epidemic process and dynamical percolation
+Normal rank
@@ Property / cites work @@
+The smallest uniform upper bound on the distance between the mean and the median of the binomial and Poisson distributions
+Normal rank
@@ Property / cites work @@
+Random generation of combinatorial structures from a uniform distribution
+Normal rank
@@ Property / cites work @@
+Q5501811
@@ Property / cites work: Q5501811 / rank @@
+Normal rank
@@ Property / cites work @@
+Monte-Carlo algorithms for the planar multiterminal network reliability problem
+Normal rank
@@ Property / cites work @@
+The Structure and Function of Complex Networks
@@ Property / cites work: The Structure and Function of Complex Networks / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Reliability Computations in Planar and Acyclic Graphs
+Normal rank
@@ Property / cites work @@
+The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
+Normal rank
@@ Property / cites work @@
+Percolation on heterogeneous networks as a model for epidemics
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Computing <i>K</i>-Terminal Reliability in Series-Parallel Networks
+Normal rank
@@ Property / cites work @@
+The Complexity of Enumeration and Reliability Problems
+Normal rank

High-confidence estimation of small <i>s</i> -<i>t</i> reliabilities in directed acyclic networks (Q3087625): Difference between revisions

Latest revision as of 10:09, 4 July 2024

Statements

Sitelinks

Mathematics(1 entry)