Cluster fault-tolerant routing in star graphs

DOI<83::AID-NET7>3.0.CO;2-D 10.1002/(SICI)1097-0037(200001)35:1<83::AID-NET7>3.0.CO;2-DzbMath0938.90068OpenAlexW2124157530MaRDI QIDQ4944745

Shietung Peng, Qian-Ping Gu

Publication date: 27 June 2000

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(200001)35:1<83::aid-net7>3.0.co;2-d

zbMATH Keywords

interconnection networknode-disjoint pathsfault-tolerant routing

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Connectivity (05C40)

Related Items

On the problem of determining which \((n, k)\)-star graphs are Cayley graphs ⋮ Node-to-node cluster fault tolerant routing in star graphs ⋮ Conditional fault-tolerant routing of (n,k)-star graphs ⋮ An algorithm for conditional-fault local diagnosis of multiprocessor systems under the \(\mathrm{MM}^\ast\) model ⋮ Linearly many faults in Cayley graphs generated by transposition trees ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item