On fault tolerant routings in general networks

DOI10.1016/0890-5401(87)90010-1zbMath0618.94017OpenAlexW1977293045MaRDI QIDQ1089309

Barbara B. Simons, David Peleg

Publication date: 1987

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(87)90010-1

zbMATH Keywords

connectivitydiameter of the surviving graphfault-tolerant routings

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Related Items (9)

On fault-tolerant fixed routing in hypercubes ⋮ Fault tolerant routing in the star and pancake interconnection networks ⋮ Large fault-tolerant interconnection networks ⋮ Optimal fault-tolerant routings with small routing tables for \(k\)-connected graphs ⋮ Highly fault-tolerant routings and diameter vulnerability for generalized hypercube graphs ⋮ Optimal fault-tolerant routings for connected graphs ⋮ Analysis of minimal path routing schemes in the presence of faults ⋮ Efficient fault-tolerant fixed routings on \((k+1)\)-connected digraphs ⋮ Graph theoretical issues in computer networks

Cites Work

• Unnamed Item

This page was built for publication: On fault tolerant routings in general networks