The following pages link to Eduardo A. Canale (Q324787):
Displaying 16 items.
- Optimal edge fault-tolerant bijective embedding of a complete graph over a cycle (Q324789) (← links)
- Superfluous edges and exponential expansions of de Bruijn and Kautz graphs (Q1827806) (← links)
- A lower bound for chaos on the elliptical stadium (Q1963440) (← links)
- The complexity of computing the 2-K-reliability in networks (Q2448852) (← links)
- Asymptotically large (\(\Delta,D\))-graphs (Q2576342) (← links)
- Cost optimized design for the local wind turbine grid of an onshore wind farm (Q2675720) (← links)
- Full complexity analysis of the diameter-constrained reliability (Q2806430) (← links)
- Exotic equilibria of Harary graphs and a new minimum degree lower bound for synchronization (Q2821608) (← links)
- Unilaterally connected large digraphs and generalized cycles (Q4446908) (← links)
- On the unilateral (?,D*)-problem (Q4520240) (← links)
- Diameter constrained reliability: Complexity, distinguished topologies and asymptotic behavior (Q4642429) (← links)
- On computing the 2‐diameter ‐constrained <i>K</i> ‐reliability of networks (Q4921254) (← links)
- On the Complexity of the Classification of Synchronizing Graphs (Q5392727) (← links)
- Complexity and heuristics for the weighted max cut‐clique problem (Q6091425) (← links)
- Optimal edge fault-tolerant embedding of a star over a cycle (Q6489483) (← links)
- Factorization and exact evaluation of the source-terminal diameter-constrained reliability (Q6496357) (← links)
