ROUTING ALGORITHMS FOR DOUBLE LOOP NETWORKS
From MaRDI portal
Publication:5286029
Recommendations
Cited in
(14)- Vertex-colouring of 3-chromatic circulant graphs
- A dynamic fault-tolerant message routing algorithm for double-loop networks
- Time complexity of link reversal routing
- scientific article; zbMATH DE number 2143949 (Why is no real title available?)
- Fault-tolerant routing in distributed loop networks
- scientific article; zbMATH DE number 109210 (Why is no real title available?)
- An optimal message routing algorithm for double-loop networks
- scientific article; zbMATH DE number 2058458 (Why is no real title available?)
- A complementary survey on double-loop networks
- Optimal routing in double loop networks
- scientific article; zbMATH DE number 3907789 (Why is no real title available?)
- Optimal fault-tolerant routing algorithm and fault-tolerant diameter in directed double-loop networks
- Algorithms for generalized round robin routing
- scientific article; zbMATH DE number 1123084 (Why is no real title available?)
This page was built for publication: ROUTING ALGORITHMS FOR DOUBLE LOOP NETWORKS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5286029)