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

@@ Property / DOI @@
-.1007/s00453-012-9703-x
@@ Property / DOI: 10.1007/s00453-012-9703-x / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-012-9703-x
+Normal rank
@@ Property / OpenAlex ID @@
+W1981755798
@@ Property / OpenAlex ID: W1981755798 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3581881
@@ Property / cites work: Q3581881 / rank @@
+Normal rank
@@ Property / cites work @@
+Sparse Reliable Graph Backbones
@@ Property / cites work: Sparse Reliable Graph Backbones / rank @@
+Normal rank
@@ Property / cites work @@
+Q3813587
@@ Property / cites work: Q3813587 / rank @@
+Normal rank
@@ Property / cites work @@
+Two Algorithms for Unranking Arborescences
@@ Property / cites work: Two Algorithms for Unranking Arborescences / rank @@
+Normal rank
@@ Property / cites work @@
+A Monte Carlo Sampling Plan for Estimating Network Reliability
+Normal rank
@@ Property / cites work @@
+Fully Dynamic Algorithms for 2-Edge Connectivity
@@ Property / cites work: Fully Dynamic Algorithms for 2-Edge Connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for the condition number of Vandermonde matrices
+Normal rank
@@ Property / cites work @@
+Q4228482
@@ Property / cites work: Q4228482 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234046
@@ Property / cites work: Q4234046 / rank @@
+Normal rank
@@ Property / cites work @@
+Countingk-component forests of a graph
@@ Property / cites work: Countingk-component forests of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Maintenance of 2- and 3-Edge-Connected Components of Graphs II
+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 @@
+Counting almost minimum cutsets with reliability applications
+Normal rank
@@ Property / cites work @@
+Efficiency of a Good But Not Linear Set Union Algorithm
+Normal rank
@@ Property / cites work @@
+Collective dynamics of ‘small-world’ networks
@@ Property / cites work: Collective dynamics of ‘small-world’ networks / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00453-012-9703-X
@@ Property / DOI: 10.1007/S00453-012-9703-X / rank @@
+Normal rank