![]() |
Volumn 7323 LNCS, Issue , 2012, Pages 41-53
|
A sublinear time algorithm for PageRank computations
|
Author keywords
[No Author keywords available]
|
Indexed keywords
DIRECTED NETWORK;
EXPECTED TIME;
INFORMATION NETWORKS;
MULTISCALES;
NETWORK ACCESS;
PAGERANK;
PAGERANK COMPUTATIONS;
POSITIVE CONSTANT;
QUERY MODEL;
RANDOMIZED ALGORITHMS;
RUNNING TIME;
SAMPLING SCHEMES;
SOCIAL NETWORK ANALYSIS;
SUBLINEAR TIME;
SUBLINEAR TIME ALGORITHMS;
ALGORITHMS;
INFORMATION SERVICES;
OPTIMIZATION;
PROBLEM SOLVING;
SOCIAL NETWORKING (ONLINE);
MATHEMATICAL MODELS;
|
EID: 84864193264
PISSN: 03029743
EISSN: 16113349
Source Type: Book Series
DOI: 10.1007/978-3-642-30541-2_4 Document Type: Conference Paper |
Times cited : (32)
|
References (12)
|