Towards an Efficient Weighted Random Walk Domination
Summary: Weighted random walk domination on weighted graphs: pick a k-set S under budget B to minimize residual access cost to S. DpSel baseline; MatrixSel matrix-based greedy; BoundSel bound-pruning; all achieve (1-1/e); real-data experiments show scalability, memory efficiency, and applicability to social advertising and base-station planning. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Songsong Mo
- 2. Zhifeng Bao
- 3. Ping Zhang
- 4. Zhiyong Peng
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 180 | Influence Maximization: Near-Optimal Time Complexity Meets Practical Efficiency | 2014 | SIGMOD | 0.00037135181 |
| 1,801 | Online Processing Algorithms for Influence Maximization | 2018 | SIGMOD | 0.00010510943 |
| 2,188 | Effective Indexing for Approximate Constrained Shortest Path Queries on Large Road Networks | 2017 | VLDB | 9.3372315e-05 |
| 2,486 | Efficient Algorithms for Budgeted Influence Maximization on Massive Social Networks | 2020 | VLDB | 8.6741469e-05 |
| 2,664 | Influence Maximization Revisited: Efficient Reverse Reachable Set Generation with Bound Tightened | 2020 | SIGMOD | 8.3512717e-05 |
| 8,310 | Confucius and Its Intelligent Disciples: Integrating Social with Search | 2010 | VLDB | 4.5435639e-05 |
Previous
Page 1 / 1
Next