activity
20142021
most citedDiameter Constrained Reliability: Computational Complexity in terms of the diameter and number of terminals

2 citations · 4 across the 5 of their papers we have counts for

collaborators

6 papers

math.OC2021★ 2 cited

Exact reliability optimization for series-parallel graphs using convex envelopes

Javiera Barrera, Eduardo Moreno, Gonzalo Muñoz +1

Given its wide spectrum of applications, the classical problem of all-terminal network reliability evaluation remains a highly relevant problem in network design. The associated op…

math.CO2020

Finding uniformly most reliable graphs by counting trivial cuts

Eduardo Canale, Guillermo Rela, Franco Robledo +1

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 con…

cs.DM2020

Analysis and Reliability of Separable Systems

Héctor Cancela, Gustavo Guerberoff, Franco Robledo +1

The operation of a system, such as a vehicle, communication network or automatic process, heavily depends on the correct operation of its components. A Stochastic Binary System (SB…

cs.DC2014

A Full Characterization of Irrelevant Components in Diameter Constrained Reliability

Eduardo Canale, Pablo Romero, Gerardo Rubino

In classical network reliability analysis, the system under study is a network with perfect nodes but imperfect link, that fail stochastically and independently. There, the goal is…

cs.DS2014

Irrelevant Components and Exact Computation of the Diameter Constrained Reliability

Eduardo Canale, Pablo Romero, Gerardo Rubino

Let be a simple graph with nodes and links, a subset of \emph{terminals}, a vector and a positive integer $d…

cs.CC2014★ 2 cited

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

Eduardo Canale, Pablo Romero

Let be a simple graph with nodes and links, a subset of \emph{terminals}, a vector and a positive integer…