Eduardo A. Canale

From MaRDI portal
(Redirected from Eduardo A. Canale)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Tromino tilings with pegs via flow networks
Procedia Computer Science
2025-12-02Paper
Factorization and exact evaluation of the source-terminal diameter-constrained reliability
Networks
2024-05-03Paper
Optimal edge fault-tolerant embedding of a star over a cycle
Matemática Contemporânea
2024-04-22Paper
Complexity and heuristics for the weighted max cut‐clique problem
International Transactions in Operational Research
2023-11-24Paper
Counterexample to a Boesch's Conjecture2022-12-07Paper
The Palindromic Trees2022-12-06Paper
Cost optimized design for the local wind turbine grid of an onshore wind farm
Annals of Operations Research
2022-09-26Paper
From weighted to unweighted graphs in Synchronizing Graph Theory2022-09-13Paper
From weighted to unweighted graphs in Synchronizing Graph Theory
(available as arXiv preprint)
2022-01-01Paper
The Palindromic Trees
(available as arXiv preprint)
2022-01-01Paper
Counterexample to a Boesch's Conjecture
(available as arXiv preprint)
2022-01-01Paper
Finding uniformly most reliable graphs by counting trivial cuts2020-12-08Paper
Tromino Tilings with Pegs via Flow Networks2020-07-24Paper
Finding uniformly most reliable graphs by counting trivial cuts
(available as arXiv preprint)
2020-01-01Paper
Diameter constrained reliability: complexity, distinguished topologies and asymptotic behavior
Networks
2018-05-23Paper
Optimal edge fault-tolerant bijective embedding of a complete graph over a cycle2016-10-17Paper
Exotic equilibria of Harary graphs and a new minimum degree lower bound for synchronization
Chaos
2016-09-21Paper
Full complexity analysis of the diameter-constrained reliability
International Transactions in Operational Research
2016-05-18Paper
A Full Characterization of Irrelevant Components in Diameter Constrained Reliability2014-10-01Paper
The complexity of computing the 2-K-reliability in networks
Information Processing Letters
2014-05-05Paper
Robustness of Cucker-Smale flocking model2014-05-01Paper
Robustness of Cucker-Smale flocking model
(available as arXiv preprint)
2014-01-01Paper
A Full Characterization of Irrelevant Components in Diameter Constrained Reliability
(available as arXiv preprint)
2014-01-01Paper
On computing the 2-diameter-constrained \(K\)-reliability of networks
International Transactions in Operational Research
2013-05-23Paper
On the complexity of the classification of synchronizing graphs
Communications in Computer and Information Science
2011-04-14Paper
Asymptotically large (\(\Delta,D\))-graphs
Discrete Applied Mathematics
2005-12-27Paper
Superfluous edges and exponential expansions of de Bruijn and Kautz graphs
Discrete Applied Mathematics
2004-08-06Paper
Unilaterally connected large digraphs and generalized cycles
Networks
2004-02-03Paper
On the unilateral (?,D*)-problem2000-12-12Paper
A lower bound for chaos on the elliptical stadium
Physica D
2000-02-01Paper


Research outcomes over time


This page was built for person: Eduardo A. Canale