AbstractWe construct fault-tolerant routings for several families of graphs, including all graphs of maximal degree less than cn13 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)
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.