A new method for constructing infinite families of \(k\)-tight optimal double loop networks
From MaRDI portal
Publication:862697
DOI10.1007/s11425-006-0525-7zbMath1109.68004OpenAlexW2127410034MaRDI QIDQ862697
Publication date: 24 January 2007
Published in: Science in China. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-006-0525-7
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An infinite family of 4-tight optimal double loop networks
- Designing of optimal double loop networks
- A Combinatorial Problem Related to Multimodule Memory Organizations
- A very short proof of a conjecture concerning set‐to‐set broadcasting
- A complementary survey on double-loop networks