17 citations · 20 across the 10 of their papers we have counts for
11 papers
Qubo model for the Closest Vector Problem
Eduardo Canale, Claudio Qureshi, Alfredo Viola
In this paper we consider the closest vector problem (CVP) for lattices given by a generator matrix . Let …
The Palindromic Trees
Tadashi Akagi, Eduardo A. Canale
The family of trees with palindromic characteristic polynomials is characterized. Large families of graphs with this property are found as well.
Counterexample to a Boesch's Conjecture
Nicole Rosenstock, Eduardo A. Canale
A key issue in network reliability analysis. A graph with nodes and whose edges fail independently with probability is an \emph{Uniformly Most Reliable Graph} (UMRG) if…
From weighted to unweighted graphs in Synchronizing Graph Theory
Eduardo A. Canale
A way to associate unweighted graphs from weighted ones is presented, such that linear stable equilibria of the Kuramoto homogeneous model associated to both graphs coincide, i.e.,…
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…
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…
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…
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…
Robustness of Cucker-Smale flocking model
Eduardo Canale, Federico Dalmao, Ernesto Mordecki +1
Consider a system of autonomous interacting agents moving in space, adjusting each own velocity as a weighted mean of the relative velocities of the other agents. In order to test…
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…
A Lower Bound for Chaos on the Elliptical Stadium
Eduardo Canale, Roberto Markarian, Sylvie Oliffson Kamphorst +1
The elliptical stadium is a plane region bounded by a curve constructed by joining two half-ellipses by two parallel segments of equal length. The billiard inside it, as a map, gen…