Comment router dans un arbre ?, in 3 èmes AlgoTel, pp.85-88, 2001. ,
Routing in Trees, 28 th ICALP, pp.757-772, 2001. ,
DOI : 10.1007/3-540-48224-5_62
URL : https://hal.archives-ouvertes.fr/hal-00307398
A Space Lower Bound for Routing in Trees, pp.65-75, 2002. ,
DOI : 10.1007/3-540-45841-7_4
URL : https://hal.archives-ouvertes.fr/hal-00307398
Planar graph decomposition and all pairs shortest paths, Journal of the ACM, vol.38, issue.1, pp.38-162, 1991. ,
DOI : 10.1145/102782.102788
Designing networks with compact routing tables, Algorithmica, vol.9, issue.No. 1, 1988. ,
DOI : 10.1007/BF01762113
Proximity-preserving labeling schemes, Journal of Graph Theory, vol.15, issue.3, pp.167-176, 2000. ,
DOI : 10.1002/(SICI)1097-0118(200003)33:3<167::AID-JGT7>3.0.CO;2-5
Compact routing schemes, Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures , SPAA '01, pp.1-10, 2001. ,
DOI : 10.1145/378580.378581