210 citations · 1.2k across the 48 of their papers we have counts for
5 papers · 1 filter
Cost-Effective Seed Selection in Online Social Networks
Kai Han, Yuntian He, Xiaokui Xiao +3
We study the min-cost seed selection problem in online social networks, where the goal is to select a set of seed nodes with the minimum total cost such that the expected number of…
ProbeSim: Scalable Single-Source and Top-k SimRank Computations on Dynamic Graphs
Yu Liu, Bolong Zheng, Xiaodong He +4
Single-source and top- SimRank queries are two important types of similarity search in graphs with numerous applications in web mining, social network analysis, spam detection,…
GraphMP: An Efficient Semi-External-Memory Big Graph Processing System on a Single Machine
Peng Sun, Yonggang Wen, Ta Nguyen Binh Duong +1
Recent studies showed that single-machine graph processing systems can be as highly competitive as cluster-based approaches on large-scale problems. While several out-of-core graph…
Refutations on "Debunking the Myths of Influence Maximization: An In-Depth Benchmarking Study"
Wei Lu, Xiaokui Xiao, Amit Goyal +2
In a recent SIGMOD paper titled "Debunking the Myths of Influence Maximization: An In-Depth Benchmarking Study", Arora et al. [1] undertake a performance benchmarking study of seve…
GraphH: High Performance Big Graph Analytics in Small Clusters
Peng Sun, Yonggang Wen, Ta Nguyen Binh Duong +1
It is common for real-world applications to analyze big graphs using distributed graph processing systems. Popular in-memory systems require an enormous amount of resources to hand…