Fault-tolerant routings in double fixed-step networks
From MaRDI portal
(Redirected from Publication:1377656)
Recommendations
Cites work
- scientific article; zbMATH DE number 4201663 (Why is no real title available?)
- scientific article; zbMATH DE number 4004216 (Why is no real title available?)
- scientific article; zbMATH DE number 4089545 (Why is no real title available?)
- scientific article; zbMATH DE number 19191 (Why is no real title available?)
- scientific article; zbMATH DE number 146672 (Why is no real title available?)
- scientific article; zbMATH DE number 176256 (Why is no real title available?)
- A Combinatorial Problem Related to Multimodule Memory Organizations
- A combinatorial problem related to distributed loop networks
- An efficient algorithm to find optimal double loop networks
- Distributed loop network with minimum transmission delay
- Large fault-tolerant interconnection networks
- Minimal diameter double-loop networks. I. Large infinite optimal families
- Minimal diameter double-loop networks: Dense optimal families
- Reliable circulant networks with minimum transmission delay
- Undirected loop networks
Cited in
(11)- Fractional routing using pairs of failure-disjoint paths
- Fault-tolerant routing in unique-path multistage Omega network
- scientific article; zbMATH DE number 7310081 (Why is no real title available?)
- Network properties of double and triple fixed step graphs
- Connectivity and diameter in distance graphs
- A survey on undirected circulant graphs
- Fault-tolerant routings in chordal ring networks
- A survey on multi-loop networks.
- Wavelength routing of uniform instances in all-optical rings
- Optimal fault-tolerant routing algorithm and fault-tolerant diameter in directed double-loop networks
- The number of spanning trees in a class of double fixed-step loop networks
This page was built for publication: Fault-tolerant routings in double fixed-step networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1377656)