On fault tolerant routings in general networks
type: Item
instance of: scholarly article
title: On fault tolerant routings in general networks
zbMATH Open document ID: 0618.94017
DOI: 10.1016/0890-5401(87)90010-1
published in: Information and Computation
publication date: 1987-01-01T00:00:00Z
review text: 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 \textit{D. Dolev, J. Halpern, B. Simons} and \textit{R. Strong} [A new look at fault tolerant network routing, in: Proc. 16th ACM Symp. Theory of Computing, 526-535 (1984)].
Mathematics Subject Classification ID: 94C15
zbMATH DE Number: 4004073
zbMATH Keywords: fault-tolerant routings
zbMATH Keywords: diameter of the surviving graph
zbMATH Keywords: connectivity
author: David Peleg
author: Barbara B. Simons
MaRDI profile type: Publication
full work available at URL: 0890-5401(87)90010-1
OpenAlex ID: W1977293045
cites work: Q3326832
description: scientific article; zbMATH DE number 4004073