Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
WWW
/
Paper
An upper bound based greedy algorithm for mining top-k influential nodes in social networks.
Chuan Zhou
,
Peng Zhang
,
Jing Guo
,
Li Guo
Venue
A*
WWW
Year
2014
Proceedings
WWW (Companion Volume)
DBLP record
conf/www/ZhouZGG14 ↗
Browse the full
WWW paper archive
.