Cluster fault-tolerant routing in star graphs
From MaRDI portal
Publication:4944745
Recommendations
- Distributed Computing – IWDC 2005
- scientific article; zbMATH DE number 1933262
- Distributed Computing - IWDC 2004
- Conditional fault-tolerant routing of \((n,k)\)-star graphs
- scientific article; zbMATH DE number 1439471
- Cluster fault-tolerant routing in pancake graphs
- Fault tolerant routing in the star and pancake interconnection networks
- Fault Tolerance on Star Graphs
- Fault tolerance of the star graph interconnection network
Cited in
(10)- Conditional fault-tolerant routing of \((n,k)\)-star graphs
- Distributed Computing – IWDC 2005
- On the problem of determining which \((n, k)\)-star graphs are Cayley graphs
- Linearly many faults in Cayley graphs generated by transposition trees
- Node-to-node cluster fault tolerant routing in star graphs
- scientific article; zbMATH DE number 1555951 (Why is no real title available?)
- Distributed Computing - IWDC 2004
- scientific article; zbMATH DE number 2230273 (Why is no real title available?)
- scientific article; zbMATH DE number 1933262 (Why is no real title available?)
- An algorithm for conditional-fault local diagnosis of multiprocessor systems under the \(\mathrm{MM}^\ast\) model
This page was built for publication: Cluster fault-tolerant routing in star graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4944745)