Routing in Trees
- 4 July 2001
- book chapter
- Published by Springer Nature
- p. 757-772
- https://doi.org/10.1007/3-540-48224-5_62
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Sparse partitionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Compact routing schemesPublished by Association for Computing Machinery (ACM) ,2001
- A survey on interval routingTheoretical Computer Science, 2000
- Proximity-Preserving Labeling Schemes and Their ApplicationsPublished by Springer Nature ,1999
- Compact routing schemes with low stretch factor (extended abstract)Published by Association for Computing Machinery (ACM) ,1998
- Memory requirement for routing in distributed networksPublished by Association for Computing Machinery (ACM) ,1996
- Factorisatio Numerorum with ConstraintsJournal of Number Theory, 1993
- A trade-off between space and efficiency for routing tablesJournal of the ACM, 1989
- Interval RoutingThe Computer Journal, 1987
- Labelling and Implicit Routing in NetworksThe Computer Journal, 1985