The expected number of pairs of connected nodes: Pair-connected reliability (Q1310221): Difference between revisions

@@ Property / author @@
-Ashok T. Amin
@@ Property / author: Ashok T. Amin / rank @@
-Normal rank
@@ Property / author @@
-Kyle T. Siegrist
@@ Property / author: Kyle T. Siegrist / rank @@
-Normal rank
@@ Property / author @@
-Q1126172
@@ Property / author: Q1126172 / rank @@
-Normal rank
@@ Property / author @@
+Ashok T. Amin
@@ Property / author: Ashok T. Amin / rank @@
+Normal rank
@@ Property / author @@
+Kyle T. Siegrist
@@ Property / author: Kyle T. Siegrist / rank @@
+Normal rank
@@ Property / author @@
+Peter J. Slater
@@ Property / author: Peter J. Slater / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+On unreliability polynomials and graph connectivity in reliable network synthesis
+Normal rank
@@ Property / cites work @@
+Computational Complexity of Network Reliability Analysis: An Overview
+Normal rank
@@ Property / cites work @@
+Synthesis of reliable networks - a survey
@@ Property / cites work: Synthesis of reliable networks - a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Maximizing the Mean Number of Communicating Vertex Pairs in Series-Parallel Networks
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for reliability analysis of planar networks - a survey
+Normal rank
@@ Property / cites work @@
+Factoring Algorithms for Computing K-Terminal Network Reliability
+Normal rank
@@ Property / cites work @@
+The cutting center theorem for trees
@@ Property / cites work: The cutting center theorem for trees / rank @@
+Normal rank
@@ Property / cites work @@
+Network reliability analysis: Part I
@@ Property / cites work: Network reliability analysis: Part I / rank @@
+Normal rank
@@ Property / cites work @@
+A linear algorithm for the cutting center of a tree
+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 @@
+Q4083484
@@ Property / cites work: Q4083484 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5585020
@@ Property / cites work: Q5585020 / rank @@
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q3819102
@@ Property / cites work: Q3819102 / rank @@
+Normal rank
@@ Property / cites work @@
+On the nonexistence of uniformly optimal graphs for pair-connected reliability
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0895-7177(93)90245-t
+Normal rank
@@ Property / OpenAlex ID @@
+W2072634584
@@ Property / OpenAlex ID: W2072634584 / rank @@
+Normal rank