A simple algorithm to find the steps of double-loop networks
From MaRDI portal
Publication:1613389
DOI10.1016/S0166-218X(01)00245-1zbMath1002.68012MaRDI QIDQ1613389
Chiuyuan Chen, Robin Chi-Feng Chan, Zhi-Xin Hong
Publication date: 29 August 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items
Procreating tiles of double commutative-step digraphs, Tessellating polyominos in the plane, An efficient algorithm to find a double-loop network that realizes a given L-shape
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Double commutative-step digraphs with minimum diameters
- 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
- A Combinatorial Problem Related to Multimodule Memory Organizations
- Reaching fault diagnosis agreement under a hybrid fault model
- A complementary survey on double-loop networks