A combinatorial problem related to distributed loop networks
From MaRDI portal
Recommendations
Cited in
(21)- Distributed loop network with minimum transmission delay
- Fault-tolerant routings in double fixed-step networks
- A family of network topologies with multiple loops and logarithmic diameter
- Isomorphisms of circulant digraphs
- Weighted multi-connected loop networks
- On the crossing numbers of loop networks and generalized Petersen graphs
- A theory of tie-set graph and its application to information network management
- A survey on undirected circulant graphs
- An optimal message routing algorithm for double-loop networks
- Finding shortest paths in distributed loop networks
- scientific article; zbMATH DE number 1382454 (Why is no real title available?)
- scientific article; zbMATH DE number 1135677 (Why is no real title available?)
- scientific article; zbMATH DE number 1487910 (Why is no real title available?)
- scientific article; zbMATH DE number 1785752 (Why is no real title available?)
- Cycle Kronecker products that are representable as optimal circulants
- scientific article; zbMATH DE number 7310081 (Why is no real title available?)
- scientific article; zbMATH DE number 7656036 (Why is no real title available?)
- Locating Number of Biswapped Networks
- Database analysis of optimal double-loop networks
- Discovery of infinite families of optimal double-loop networks with a given template of generators
- Improved upper and lower bounds on the optimization of mixed chordal ring networks
This page was built for publication: A combinatorial problem related to distributed loop networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3474494)
