Efficient fault-tolerant routings in networks

DOI10.1016/0890-5401(87)90063-0zbMath0622.94034OpenAlexW2095205044MaRDI QIDQ1091360

Danny Dolev, Michael J. Fischer, Andrei Z. Broder, Barbara B. Simons

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)90063-0

zbMATH Keywords

product route graphsurviving route graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) 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 ⋮ Reliable broadcasts and communication models: tradeoffs and lower bounds ⋮ 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 ⋮ Efficient fault-tolerant fixed routings on \((k+1)\)-connected digraphs ⋮ Graph theoretical issues in computer networks

Cites Work

• Unnamed Item
• Unnamed Item
• Graph multiplication
• A new look at fault-tolerant network routing
• Graphs as models of communication network vulnerability: Connectivity and persistence
• On a measure of communication network vulnerability

This page was built for publication: Efficient fault-tolerant routings in networks