On fault-tolerant fixed routing in hypercubes

DOI10.1016/0020-0190(94)00075-1zbMath0821.68008OpenAlexW2080885019MaRDI QIDQ1332767

Suresh Viswanathan, Abhijit Sengupta

Publication date: 5 September 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00075-1

zbMATH Keywords

survival route graphs of hypercubes

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Cites Work

• On fault tolerant routings in general networks
• Efficient fault-tolerant routings in networks
• A new look at fault-tolerant network routing
• Fault-tolerant routings in a \(\kappa\)-connected network
• Fault-tolerant routings in Kautz and de Bruijn networks
• Efficient fault-tolerant fixed routings on \((k+1)\)-connected digraphs
• Combinatorial analysis of the fault-diameter of the n-cube
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On fault-tolerant fixed routing in hypercubes