Effective and Efficient PageRank-based Positioning for Graph Visualization
Summary: PDist, a PageRank-based node distance for graph visualization. Tau-Push estimates PDist with theoretical guarantees for single-/multi-level layouts and delivers sub-second interactive visualizations on billion-edge graphs, beating 13 baselines on 12 real graphs. (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. Shiqi Zhang (National University of Singapore; Southern University of Science and Technology)
- 2. Renchi Yang (Hong Kong Baptist University)
- 3. Xiaokui Xiao (National University of Singapore)
- 4. Xiao Yan (Southern University of Science and Technology)
- 5. Bo Tang (Southern University of Science and Technology)
BibTeX Citation
@inproceedings{zhang_sigmod23,
title = {{Effective and Efficient PageRank-based Positioning for Graph Visualization}},
author = {Zhang, Shiqi and Yang, Renchi and Xiao, Xiaokui and Yan, Xiao and Tang, Bo},
series = {{SIGMOD} '23},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3588930},
url = {https://dl.acm.org/doi/10.1145/3588930},
year = {2023}
}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 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 264 | The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing | 2018 | VLDB | 0.00022980015 |
| 1,769 | BEAR: Block Elimination Approach for Random Walk with Restart on Large Graphs | 2015 | SIGMOD | 9.7969398e-05 |
| 1,968 | Homogeneous Network Embedding for Massive Graphs via Reweighted Personalized PageRank | 2020 | VLDB | 9.3752727e-05 |
| 2,073 | BePI: Fast and Memory-Efficient Method for Billion-Scale Random Walk with Restart | 2017 | SIGMOD | 9.2209912e-05 |
| 2,173 | Unifying the Global and Local Approaches: An Efficient Power Iteration with Forward Push | 2021 | SIGMOD | 9.0375634e-05 |
| 2,225 | HubPPR: Effective Indexing for Approximate Personalized PageRank | 2017 | VLDB | 8.9183159e-05 |
| 3,892 | Massively Parallel Algorithms for Personalized PageRank | 2021 | VLDB | 7.0430255e-05 |
| 4,225 | Realtime Top-k Personalized PageRank over Large Graphs on GPUs | 2020 | VLDB | 6.821373e-05 |
| 8,529 | AURORA: Data-driven Construction of Visual Graph Query Interfaces for Graph Databases | 2020 | SIGMOD | 5.4119882e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,913 | Efficient Estimation of Heat Kernel PageRank for Local Clustering | 2019 | SIGMOD |
| 2 | 4,714 | Personalized PageRank on Evolving Graphs with an Incremental Index-Update Scheme | 2023 | SIGMOD |
| 3 | 4,572 | On the Embeddability of Random Walk Distances | 2013 | VLDB |
| 4 | 8,063 | Estimating Single-Node PageRank in O~(min{d_t, sqrt(m)}) Time | 2023 | VLDB |
| 5 | 3,315 | Distributed Algorithms on Exact Personalized PageRank | 2017 | SIGMOD |
| 6 | 9,373 | Efficient and Accurate PageRank Approximation on Large Graphs | 2024 | SIGMOD |
| 7 | 1,968 | Homogeneous Network Embedding for Massive Graphs via Reweighted Personalized PageRank | 2020 | VLDB |
| 8 | 6,284 | Efficient Personalized PageRank Computation: A Spanning Forests Sampling Based Approach | 2022 | SIGMOD |
| 9 | 2,362 | Incremental and Accuracy-Aware Personalized PageRank through Scheduled Approximation | 2013 | VLDB |
| 10 | 5,139 | Edge-based Local Push for Personalized PageRank | 2022 | VLDB |