An efficient algorithm to find optimal double loop networks
From MaRDI portal
Publication:1842140
DOI10.1016/0012-365X(95)94025-8zbMath0816.68089OpenAlexW2015987608MaRDI QIDQ1842140
Francesc Aguiló, Miquel Àngel Fiol
Publication date: 19 July 1995
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(95)94025-8
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Combinatorial aspects of tessellation and tiling problems (05B45) Directed graphs (digraphs), tournaments (05C20)
Related Items (13)
A simple algorithm to find the steps of double-loop networks ⋮ Triple loop networks with small transmission delay ⋮ A symbolical algorithm on additive basis and double-loop networks ⋮ Fault-tolerant routings in double fixed-step networks ⋮ Procreating tiles of double commutative-step digraphs ⋮ A complementary survey on double-loop networks ⋮ An efficient algorithm to find a double-loop network that realizes a given L-shape ⋮ Improved upper and lower bounds on the optimization of mixed chordal ring networks ⋮ Triple-loop networks with arbitrarily many minimum distance diagrams ⋮ New dense families of triple loop networks ⋮ An efficient algorithm to find optimal double loop networks ⋮ Using Double-Loop digraphs for solving Frobenius' Problems ⋮ Some contributions to the Frobenius' Problem
Cites Work
- Double commutative-step digraphs with minimum diameters
- Congruences in \({\mathbb{Z}}^ n\), finite Abelian groups and the Chinese remainder theorem
- Distributed loop network with minimum transmission delay
- Double loop networks with minimum delay
- An efficient algorithm to find optimal double loop networks
- Diameters of weighted double loop networks
- Two theorems on matrices
- A Combinatorial Problem Related to Multimodule Memory Organizations
- Unnamed Item
- Unnamed Item
This page was built for publication: An efficient algorithm to find optimal double loop networks
