2 papers
math.CO2026
On the most reliable graphs with fixed redundancy
Rotem Brand, Reuven Cohen, Simi Haber +1
The all-terminal reliability of a graph is the probability that remains connected when each edge fails independently with probability . For fixed and , the unifor…
cs.DM2023
Cost-effective network robustness
Rotem Brand, Simcha Haber, Reuven Cohen +6
Modern society relies heavily on infrastructure networks, from communication to power systems, making their reliability under failure and disruption critical. Robustness typically…