Guillermo Rela
YOU?
Author Swipe
View article: The complete bipartite graph $K_{4,4}$ is Uniformly Most-Reliable
The complete bipartite graph $K_{4,4}$ is Uniformly Most-Reliable Open
In network design, the all-terminal reliability maximization is of paramount importance. In this classical setting, we assume a simple graph with perfect nodes but independent edge failures with identical probability $\rho$. The goal is to…
View article: Finding uniformly most reliable graphs by counting trivial cuts
Finding uniformly most reliable graphs by counting trivial cuts Open
There is a vast literature focused on network reliability evaluation. In the last decades, reliability optimization has been also addressed. Frank Boesch in 1986 introduced the concept of uniformly most reliable graph (UMRG). Later, Boesch…