17 citations · 20 across the 10 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
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.DS2020
Tromino Tilings with Pegs via Flow Networks
Javier T. Akagi, Eduardo A. Canale, Marcos Villagra
A tromino tiling problem is a packing puzzle where we are given a region of connected lattice squares and we want to decide whether there exists a tiling of the region using tromin…