Combinatorics, Probability and Computing (2005), 14 : 339-348 Cambridge University Press
Copyright © 2005 Cambridge University Press
doi:10.1017/S0963548304006133 (About doi)
Published online by Cambridge University Press 11 Apr 2005
Copy and paste this link:
http://journals.cambridge.org/action/displayAbstract?aid=293400
Copy and paste this citation
TAMÁS F. MÓRI
(2005).
The Maximum Degree of the Barabási–Albert Random Tree. Combinatorics, Probability and Computing,
14
,
pp 339-348
doi:10.1017/S0963548304006133
doi:10.1017/S0963548304006133
CiteULike
Del.icio.us
Connotea.org
Bibsonomy.org
Furl.net
Digg.com
Reddit.com
Facebook
