1.2k citations · 2k across the 19 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
physics.soc-ph2014★ 65 cited
Identifying effective multiple spreaders by coloring complex networks
Xiang-Yu Zhao, Bin Huang, Ming Tang +2
How to identify influential nodes in social networks is of theoretical significance, which relates to how to prevent epidemic spreading or cascading failure, how to accelerate info…
cs.SI2014
An approximation algorithm for shortest path based on the hierarchy networks
Shi-nan Gong, Duan-bing Chen, Hui Gao +2
It is a critical issue to compute the shortest paths between nodes in networks. Exact algorithms for shortest paths are usually inapplicable for large scale networks due to the hig…