Author:
Fraigniaud Pierre,Gavoille Cyril
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. B. Awerbuch AND D. Peleg, Sparse partitions, in 31th Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society Press, 1990, pp. 503–513.
2. L. J. Cowen, Compact routing with minimum stretch, in 10th Symposium on Discrete Algorithms (SODA), ACM-SIAM, 1999, pp. 255–260.
3. T. Eilam, C. Gavoille, AND D. Peleg, Compact routing schemes with low stretch factor, in 17th Annual ACM Symposium on Principles of Distributed Computing (PODC), ACM PRESS, Aug. 1998, pp. 11–20.
4. C. Gavoille, A survey on interval routing, Theoretical Computer Science, 245 (2000), pp. 217–253.
5. C. Gavoille AND S. Pérennès, Memory requirement for routing in distributed networks, in 15th Annual ACM Symposium on Principles of Distributed Computing (PODC), ACM PRESS, May 1996, pp. 125–133.
Cited by
72 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献