Discrete Optimization Problem in Local Networks and Data Alignment
IEEE Transactions on Computers
A Combinatorial Problem Related to Multimodule Memory Organizations
Journal of the ACM (JACM)
A complementary survey on double-loop networks
Theoretical Computer Science
A simple algorithm to find the steps of double-loop networks
Discrete Applied Mathematics
A symbolical algorithm on additive basis and double-loop networks
Theoretical Computer Science - Combinatorics of the discrete plane and tilings
An Optimal Fault-Tolerant Routing Algorithm for Weighted Bidirectional Double-Loop Networks
IEEE Transactions on Parallel and Distributed Systems
An efficient algorithm to find a double-loop network that realizes a given L-shape
Theoretical Computer Science
On the wide diameter of directed double-loop networks
Journal of Network and Computer Applications
A constant time optimal routing algorithm for undirected double-loop networks
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
| Hi-index | 14.98 |
It is well-known that the minimum distance diagram of a double-loop network yields an L-shape. It is important to know, for a given L-shape, whether there exists a double-loop network realizing it. Necessary and sufficient conditions were given before, but were said to be cumbersome. They also need some clarification. We give new conditions and a simple proof. We also prove that all double-loop networks realizing the same L-shape are isomorphic as the existing proof was given in a Spanish dissertation.