Procreating tiles of double commutative-step digraphs
From MaRDI portal
Publication:942869
DOI10.1007/s10255-004-4102-yzbMath1144.05030OpenAlexW2122767631MaRDI QIDQ942869
Publication date: 8 September 2008
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-004-4102-y
Network design and communication in computer systems (68M10) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Unnamed Item
- An infinite family of 4-tight optimal double loop networks
- Double commutative-step digraphs with minimum diameters
- The infinite families of optimal double loop networks
- Distributed loop network with minimum transmission delay
- A simple algorithm to find the steps of double-loop networks
- An efficient algorithm to find optimal double loop networks
- A Combinatorial Problem Related to Multimodule Memory Organizations
- Discrete dynamics over double commutative-step digraphs
- A complementary survey on double-loop networks
This page was built for publication: Procreating tiles of double commutative-step digraphs