Full complexity analysis of the diameter-constrained reliability (Q2806430): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1111/itor.12159
+Normal rank
@@ Property / OpenAlex ID @@
+W2156583013
@@ Property / OpenAlex ID: W2156583013 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity of Network Reliability Analysis: An Overview
+Normal rank
@@ Property / cites work @@
+On computing the 2‐diameter ‐constrained <i>K</i> ‐reliability of networks
+Normal rank
@@ Property / cites work @@
+The complexity of computing the 2-K-reliability in networks
+Normal rank
@@ Property / cites work @@
+Reliability of communication networks with delay constraints: computational complexity and complete topologies
+Normal rank
@@ Property / cites work @@
+Minimum-weight two-connected spanning networks
@@ Property / cites work: Minimum-weight two-connected spanning networks / rank @@
+Normal rank
@@ Property / cites work @@
+Q4329144
@@ Property / cites work: Q4329144 / rank @@
+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 @@
+Computing the Reliability of Complex Networks
@@ Property / cites work: Computing the Reliability of Complex Networks / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Enumeration and Reliability Problems
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2806430