Pablo Romero

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

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

collaborators

4 papers

math.CO2023

Nonexistence of uniformly most reliable graphs of least corank

Pablo Romero, Martín D. Safe

If $G$ is a simple graph and $ρ \in [0, 1]$ , the reliability $R_{G} (ρ)$ is the probability of $G$ being connected after each of its edges is removed independently with probability $ρ$ .…

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 $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}, ..., p_{m}) \in [0, 1]^{m}$ 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 $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…