Compact Routing with Minimum Stretch
- 1 January 2001
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 38 (1), 170-183
- https://doi.org/10.1006/jagm.2000.1134
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Compact Routing with Stretch Factor of Less Than ThreeIEICE Transactions on Information and Systems, 2005
- Compact roundtrip routing in directed networksJournal of Algorithms, 2004
- Compact routing schemes with low stretch factorJournal of Algorithms, 2003
- Improved routing strategies with succinct tablesJournal of Algorithms, 1990
- A trade-off between space and efficiency for routing tablesJournal of the ACM, 1989
- Graph spannersJournal of Graph Theory, 1989
- Designing networks with compact routing tablesAlgorithmica, 1988
- Complexity of network synchronizationJournal of the ACM, 1985
- On the ratio of optimal integral and fractional coversDiscrete Mathematics, 1975
- A note on two problems in connexion with graphsNumerische Mathematik, 1959