Diameter Constrained Reliability: Computational Complexity in terms of the diameter and number of terminals

Eduardo Canale, Pablo Romero

Let $G=(V,E)$ be a simple graph with $|V|=n$ nodes and $|E|=m$ links, a subset $K\subseteq V$ of \emph{terminals}, a vector $p=(p_1,\dots ,p_m)\in [0,1{]}^m$ and a positive integer…