Efficient fault-tolerant fixed routings on \((k+1)\)-connected digraphs

DOI10.1016/0166-218X(92)90157-6zbMath0755.94025OpenAlexW1991404387MaRDI QIDQ1199456

Koichi Wada, Kimio Kawaguchi

Publication date: 16 January 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(92)90157-6

zbMATH Keywords

graphdirected graphscommunication networknode faultsroutingsfault-tolerant measures

Mathematics Subject Classification ID

Circuits, networks (94C99) Fault detection; testing in circuits and networks (94C12) Applications of graph theory to circuits and networks (94C15)

Related Items

On fault-tolerant fixed routing in hypercubes ⋮ Fault tolerant routing in the star and pancake interconnection networks ⋮ Optimal fault-tolerant routings with small routing tables for \(k\)-connected graphs ⋮ Optimal fault-tolerant routings for connected graphs

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
• Optimal fault-tolerant routings for connected graphs
• Parallel concepts in graph theory
• Authenticated Algorithms for Byzantine Agreement