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
- 2. Rong-Hua Li
- 3. Qi Zhang
- 4. Hongchao Qin
- 5. Lu Qin
- 6. Guoren Wang
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,037 | The Power of Core Clique Removal for Exact Clique Enumeration | 2026 | SIGMOD | 4.1945683e-05 |
| 10,490 | Integral Densest Subgraph Search on Directed Graphs | 2025 | SIGMOD | 4.1945683e-05 |
| 10,673 | When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction | 2025 | VLDB | 4.1945683e-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 |
|---|---|---|---|---|
| 108 | Truss Decomposition in Massive Networks | 2012 | VLDB | 0.00048300163 |
| 283 | Querying K-Truss Community in Large and Dynamic Graphs | 2014 | SIGMOD | 0.00029041257 |
| 589 | Massive Graph Triangulation | 2013 | SIGMOD | 0.00019576567 |
| 738 | Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis | 2013 | VLDB | 0.00017435236 |
| 1,257 | Influential Community Search in Large Networks | 2015 | VLDB | 0.00013020648 |
| 1,853 | On Brewing Fresh Espresso: LinkedIn’s Distributed Data Serving Platform | 2013 | SIGMOD | 0.00010320369 |
| 2,436 | Efficient Structural Graph Clustering: An Index-Based Approach | 2018 | VLDB | 8.8252104e-05 |
| 7,268 | Top-K Structural Diversity Search in Large Networks | 2013 | VLDB | 4.7817823e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,264 | Approximating Probabilistic Group Steiner Trees in Graphs | 2023 | VLDB | 4.1945683e-05 |
| 10,490 | Integral Densest Subgraph Search on Directed Graphs | 2025 | SIGMOD | 4.1945683e-05 |
| 10,865 | Approximate Anchored Densest Subgraph Search on Large Static and Dynamic Graphs | 2025 | VLDB | 4.1945683e-05 |
| 6,207 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD | 5.1572428e-05 |
| 2,846 | Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs | 2019 | SIGMOD | 8.0234377e-05 |
| 10,985 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD | 4.1945683e-05 |
| 10,882 | Towards Scalable and Practical Batch-Dynamic Connectivity | 2025 | VLDB | 4.1945683e-05 |
| 7,716 | Minimum Strongly Connected Subgraph Collection in Dynamic Graphs | 2024 | VLDB | 4.6696364e-05 |
| 11,048 | Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs | 2024 | VLDB | 4.1945683e-05 |
| 10,383 | Minimum Spanning Tree Maintenance in Dynamic Graphs | 2025 | SIGMOD | 4.1945683e-05 |