NewFriends: an algorithm for computing the minimum number of friends required by a user to get the highest PageRank in a social network

Author： Moreno Francisco   González Andrés   Valencia Andrés  

Publisher： Taylor & Francis Ltd

ISSN： 0020-7160

Source： International Journal of Computer Mathematics, Vol.91, Iss.2, 2014-02, pp. : 278-290

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

An Arnoldi-type algorithm for computing page rank

By Golub G. H.  

Bit Numerical Mathematics, Vol. 46, Iss. 4, 2006-12 ,pp. : 759-771

Springer Publishing Company

Access to resources Recommend Favorite

Access Log Analysis with PageRank

By  

ELECTRONICS & COMMUNICATIONS IN JAPAN, Vol. 98, Iss. 9, 2015-09 ,pp. : 23-30

John Wiley & Sons Inc

Access to resources Recommend Favorite

An improved Apriori–based algorithm for friends recommendation in microblog

By  

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS (ELECTRONIC), Vol. 31, Iss. 2, 2018-01 ,pp. : n/a-n/a

John Wiley & Sons Inc

Access to resources Recommend Favorite

A Dynamical System for PageRank with Time-Dependent Teleportation

By Gleich David F.   Rossi Ryan A.  

Internet Mathematics, Vol. 10, Iss. 1-2, 2014-04 ,pp. : 188-217

Taylor & Francis Ltd

Access to resources Recommend Favorite

Dirichlet PageRank and Ranking Algorithms Based on Trust and Distrust

By Chung Fan   Tsiatas Alexander   Xu Wensong  

Internet Mathematics, Vol. 9, Iss. 1, 2013-01 ,pp. : 113-134

Taylor & Francis Ltd

Access to resources Recommend Favorite