Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs
Summary: Two new approximation algorithms with provable guarantees that drastically reduce parametric max-flow calls for computing pseudoarboricity, improving accuracy and efficiency over prior 2-approx methods. Complementary dynamic maintenance (two general, two insertion-only) with experiments on 195 real graphs showing strong scalability and practicality. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yalong Zhang (Beijing Institute of Technology)
- 2. Rong-Hua Li (Beijing Institute of Technology)
- 3. Qi Zhang (Beijing Institute of Technology)
- 4. Hongchao Qin (Beijing Institute of Technology)
- 5. Lu Qin (University of Technology Sydney)
- 6. Guoren Wang (Beijing Institute of Technology)
BibTeX Citation
@article{zhang_vldb24,
title = {{Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs}},
author = {Zhang, Yalong and Li, Rong-Hua and Zhang, Qi and Qin, Hongchao and Qin, Lu and Wang, Guoren},
journal = {PVLDB},
series = {{VLDB} '24},
volume = {17},
number = {11},
pages = {2722--2734},
doi = {10.14778/3681954.3681958},
url = {https://doi.org/10.14778/3681954.3681958},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,291 | Integral Densest Subgraph Search on Directed Graphs | 2025 | SIGMOD | 5.031399e-05 |
| 10,407 | Scaling Up Density Decomposition on Massive Graphs | 2027 | SIGMOD | 4.9605343e-05 |
| 10,613 | The Power of Core Clique Removal for Exact Clique Enumeration | 2026 | SIGMOD | 4.9605343e-05 |
| 11,376 | When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction | 2025 | VLDB | 4.9605343e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 96 | Truss Decomposition in Massive Networks | 2012 | VLDB | 0.00034261728 |
| 182 | Querying K-Truss Community in Large and Dynamic Graphs | 2014 | SIGMOD | 0.00026383593 |
| 580 | Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis | 2013 | VLDB | 0.00016057466 |
| 599 | Massive Graph Triangulation | 2013 | SIGMOD | 0.00015700433 |
| 970 | Influential Community Search in Large Networks | 2015 | VLDB | 0.00012749284 |
| 2,026 | On Brewing Fresh Espresso: LinkedIn’s Distributed Data Serving Platform | 2013 | SIGMOD | 9.1520193e-05 |
| 2,470 | Efficient Structural Graph Clustering: An Index-Based Approach | 2018 | VLDB | 8.4015437e-05 |
| 5,298 | Top-K Structural Diversity Search in Large Networks | 2013 | VLDB | 6.1768321e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,825 | Approximating Probabilistic Group Steiner Trees in Graphs | 2023 | VLDB |
| 2 | 10,291 | Integral Densest Subgraph Search on Directed Graphs | 2025 | SIGMOD |
| 3 | 9,768 | Approximate Anchored Densest Subgraph Search on Large Static and Dynamic Graphs | 2025 | VLDB |
| 4 | 4,567 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD |
| 5 | 2,246 | Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs | 2019 | SIGMOD |
| 6 | 11,595 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD |
| 7 | 11,513 | Towards Scalable and Practical Batch-Dynamic Connectivity | 2025 | VLDB |
| 8 | 7,743 | Minimum Strongly Connected Subgraph Collection in Dynamic Graphs | 2024 | VLDB |
| 9 | 9,957 | Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs | 2024 | VLDB |
| 10 | 11,182 | Minimum Spanning Tree Maintenance in Dynamic Graphs | 2025 | SIGMOD |