A practical bounding algorithm for computing two-terminal reliability based on decomposition technique (Q636690): Difference between revisions

@@ Property / DOI @@
-.1016/j.camwa.2010.09.033
@@ Property / DOI: 10.1016/j.camwa.2010.09.033 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.camwa.2010.09.033
+Normal rank
@@ Property / OpenAlex ID @@
+W1993210728
@@ Property / OpenAlex ID: W1993210728 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity of Network Reliability Analysis: An Overview
+Normal rank
@@ Property / cites work @@
+A Reliability Bound for Systems of Maintained, Interdependent Components
+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 @@
+Practical sequential bounds for approximating two-terminal reliability
+Normal rank
@@ Property / cites work @@
+The number of s-dimensional faces in a complex: An analogy between the simplex and the cube
+Normal rank
@@ Property / cites work @@
+Q4248175
@@ Property / cites work: Q4248175 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.CAMWA.2010.09.033
@@ Property / DOI: 10.1016/J.CAMWA.2010.09.033 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:636690