Multihoming in computer networks: A topology-design approach
- 28 February 1990
- journal article
- Published by Elsevier in Computer Networks and ISDN Systems
- Vol. 18 (2) , 133-141
- https://doi.org/10.1016/0169-7552(90)90140-n
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- A mean-time comparison of algorithms for the all-pairs shortest-path problem with arbitrary arc lengthsNetworks, 1978
- An algorithm for finding all shortest paths using N2.81 infinite-precision multiplicationsInformation Processing Letters, 1976