Author:
Gavoille Cyril,Peleg David
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. N. Alon and J. H. Spencer, The Probabilistic Method, John Wiley & Sons, 1992.
2. B. Bollobás, Random Graphs, Academic Press, New York, 1975.
3. H. Buhrman, J.-H. Hoepman, and P. Vitányi, Optimal routing tables, in 15th Annual ACM Symposium on Principles of Distributed Computing (PODC), May 1996.
4. H. Buhrman, M. Li, and P. Vitányi, Kolmogorov random graphs and the incompressibility method, in IEEE Conference on Compression and Complexity of Sequences, IEEE Comp. Soc. Press, 1997.
5. M. Flammini, J. van Leeuwen, and A. Marchetti-Spaccamela, The complexity of interval routing on random graphs, in 20th International Symposium on Mathematical Foundations of Computer Sciences (MFCS), J. Wiederman and P. Hájek, eds., vol. 969 of Lecture Notes in Computer Science, Springer-Verlag, Aug. 1995, pp. 37–49.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Interval Routing Schemes for Circular-Arc Graphs;International Journal of Foundations of Computer Science;2017-01
2. Average stretch analysis of compact routing schemes;Discrete Applied Mathematics;2007-03
3. A survey on interval routing;Theoretical Computer Science;2000-08