Article thumbnail

On fault tolerant routings in general networks

By David Peleg and Barbara Simons


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)

Publisher: Published by Elsevier Inc.
Year: 1987
DOI identifier: 10.1016/0890-5401(87)90010-1
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://s3-eu-west-1.amazonaws... (external link)
  • (external link)

  • To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.

    Suggested articles