Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Lecture Notes in Computer Science;B.V. Cherkassky,1996
2. Clauset, A., Moore, C., Newman, M.E.J.: Hierarchical structure and the prediction of missing links in networks. Nature 453(7191), 98–101 (2008)
3. Cormen, T.H., Stein, C., Rivest, R.L., Leiserson, C.E.: Introduction to Algorithms. McGraw-Hill Higher Education (2001)
4. Dinur, I., Safra, S.: On the hardness of approximating vertex cover. Annals of Mathematics 162(1), 439–485 (2005)
5. Elo, A.E.: The rating of chessplayers, past and present. Arco Pub. (1978)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献