Author:
Nehéz Martin,Olejár Daniel
Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. Bollobás, B.: Random Graphs, 2nd edn. Cambridge Studies in Advanced Mathmatics 73 (2001)
2. Bollobás, B., Erdös, P.: Cliques in random graphs. Math. Proc. Cam. Phil. Soc. 80, 419–427 (1976)
3. Bononi, L.: A Perspective on P2P Paradigm and Services, Slide courtesy of A. Montresor, http://www.cs.unibo.it/people/faculty/bononi//AdI2004/AdI11.pdf
4. Buhrman, H., Hoepman, J.-H., Vitányi, P.M.B.: Space-efficient Routing Tables for Almost All Networks and the Incompressibility Method. SIAM Journal on Computing 28(4), 1414–1432 (1999)
5. Buhrman, H., Li, M., Tromp, J., Vitányi, P.M.B.: Kolmogorov Random Graphs and the Incompressibility Method. SIAM Journal on Computing 29(2), 590–599 (1999)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献