Efficient fault-tolerant routings in networks
From MaRDI portal
Publication:1091360
DOI10.1016/0890-5401(87)90063-0zbMath0622.94034MaRDI QIDQ1091360
Danny Dolev, Andrei Z. Broder, Michael J. Fischer, 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
68R10: Graph theory (including graph drawing) in computer science
94C15: Applications of graph theory to circuits and networks
Related Items
Optimal fault-tolerant routings with small routing tables for \(k\)-connected graphs, Reliable broadcasts and communication models: tradeoffs and lower bounds, Large fault-tolerant interconnection networks, Optimal fault-tolerant routings for connected graphs, Efficient fault-tolerant fixed routings on \((k+1)\)-connected digraphs, Graph theoretical issues in computer networks, On fault-tolerant fixed routing in hypercubes, Fault tolerant routing in the star and pancake interconnection networks
Cites Work