Cluster fault-tolerant routing in star graphs
DOI10.1002/(SICI)1097-0037(200001)35:1%3C83::AID-NET7%3E3.0.CO;2-DzbMATH Open0938.90068OpenAlexW2124157530MaRDI QIDQ4944745FDOQ4944745
Authors: Qian-Ping Gu, Shietung Peng 
Publication date: 27 June 2000
Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(200001)35:1%3C83::aid-net7%3E3.0.co;2-d
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
Connectivity (05C40) Communication networks in operations research (90B18) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Network design and communication in computer systems (68M10)
Cites Work
Cited In (10)
- On the problem of determining which \((n, k)\)-star graphs are Cayley graphs
- Distributed Computing – IWDC 2005
- Title not available (Why is that?)
- Node-to-node cluster fault tolerant routing in star graphs
- Title not available (Why is that?)
- Linearly many faults in Cayley graphs generated by transposition trees
- Distributed Computing - IWDC 2004
- Conditional fault-tolerant routing of \((n,k)\)-star graphs
- Title not available (Why is that?)
- 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)
