TY - JOUR
T1 - On fault tolerant routings in general networks
AU - Peleg, David
AU - Simons, Barbara
PY - 1987/7
Y1 - 1987/7
N2 - We construct fault-tolerant routings for several families of graphs, including all graphs of maximal degree less than cn 1 3 for some c>0. With these routings, the diameter of the surviving graph is bounded by a constant (e.g., 4 or 6), so long as the number of faults is less than the connectivity of the graph. This result partially confirms a conjecture of Dolev et al. (1984, in "Proceedings, 16th ACM Symp. on Theory of Comput.," pp. 526-535).
AB - We construct fault-tolerant routings for several families of graphs, including all graphs of maximal degree less than cn 1 3 for some c>0. With these routings, the diameter of the surviving graph is bounded by a constant (e.g., 4 or 6), so long as the number of faults is less than the connectivity of the graph. This result partially confirms a conjecture of Dolev et al. (1984, in "Proceedings, 16th ACM Symp. on Theory of Comput.," pp. 526-535).
UR - http://www.scopus.com/inward/record.url?scp=0023378952&partnerID=8YFLogxK
U2 - 10.1016/0890-5401(87)90010-1
DO - 10.1016/0890-5401(87)90010-1
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0023378952
SN - 0890-5401
VL - 74
SP - 33
EP - 49
JO - Information and Computation
JF - Information and Computation
IS - 1
ER -