Efficient fault-tolerant fixed routings on (k+1)-connected digraphs
- 15 July 1992
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 37-38, 539-552
- https://doi.org/10.1016/0166-218x(92)90157-6
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Fault-tolerant routings in a K-connected networkInformation Processing Letters, 1988
- Efficient fault-tolerant routings in networksInformation and Computation, 1987
- On fault tolerant routings in general networksInformation and Computation, 1987
- A new look at fault-tolerant network routingInformation and Computation, 1987
- Authenticated Algorithms for Byzantine AgreementSIAM Journal on Computing, 1983