DBScholar

Back to papers

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)

Paper ID
12763
Venue
VLDB
Year
2021
Pagerank
5.093636e-05
Overall Rank
11,734 | 19.50%
DOI
10.14778/3436905.3436915

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@article{mo_vldb21,
        title = {{Towards an Efficient Weighted Random Walk Domination}},
        author = {Mo, Songsong and Bao, Zhifeng and Zhang, Ping and Peng, Zhiyong},
        journal = {PVLDB},
        series = {{VLDB} '21},
        volume = {14},
        number = {4},
        pages = {560--572},
        doi = {10.14778/3436905.3436915},
        url = {https://doi.org/10.14778/3436905.3436915},
        year = {2021}
}

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.

Previous Page 1 / 1 Next

Semantically Similar Papers