Designing networks with compact routing tables
- 1 November 1988
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 3 (1-4), 171-190
- https://doi.org/10.1007/bf01762113
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Separator-based strategies for efficient message routingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Optimal message routing without complete routing tablesPublished by Association for Computing Machinery (ACM) ,1986
- Computer Networks with Compact Routing TablesPublished by Springer Nature ,1986
- Labelling and Implicit Routing in NetworksThe Computer Journal, 1985
- Implicit Data Structures for the Dictionary ProblemJournal of the ACM, 1983
- Implicit data structures for fast search and updateJournal of Computer and System Sciences, 1980
- Approximation Algorithms for Some Postman ProblemsJournal of the ACM, 1979
- A Separator Theorem for Planar GraphsSIAM Journal on Applied Mathematics, 1979
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- A Theorem on Boolean MatricesJournal of the ACM, 1962