Bonding Vertex Sets Over Distributed Graph: A Betweenness Aware Approach
Summary: VSB (Vertex Set Bonding): a query returning a minimum vertex set maximizing betweenness and reachability between vertex sets. Distributed framework with guided exploration and betweenness ranking yields error-bounded results in bounded space and speedups. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Xiaofei Zhang
- 2. Hong Cheng
- 3. Lei Chen
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,675 | Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale | 2022 | VLDB | 4.6817479e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4 | Pregel: A System for Large-Scale Graph Processing | 2010 | SIGMOD | 0.0019005923 |
| 1,054 | On k-skip Shortest Paths | 2011 | SIGMOD | 0.00014422699 |
| 1,171 | Blogel: A Block-Centric Framework for Distributed Computation on Real-World Graphs | 2014 | VLDB | 0.00013511313 |
| 2,529 | Pregelix: Big(ger) Graph Analytics on A Dataflow Engine | 2015 | VLDB | 8.5940768e-05 |
| 2,766 | On k-Path Covers and their Applications | 2014 | VLDB | 8.1526804e-05 |
| 4,211 | Querying Big Graphs within Bounded Resources | 2014 | SIGMOD | 6.3563454e-05 |
| 7,236 | Toward a Distance Oracle for Billion-Node Graphs | 2014 | VLDB | 4.7932355e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,054 | Performance Guarantees for Distributed Reachability Queries | 2012 | VLDB | 5.7321997e-05 |
| 5,854 | Diversified Top-k Subgraph Querying in a Large Graph | 2016 | SIGMOD | 5.3006473e-05 |
| 11,064 | Efficient Betweenness Centrality Computation over Large Heterogeneous Information Networks | 2024 | VLDB | 4.1945683e-05 |
| 6,081 | Subgraph Matching over Graph Federation | 2022 | VLDB | 5.2208051e-05 |
| 8,070 | The shortest path is not always a straight line: Leveraging semi-metricity in graph analysis | 2016 | VLDB | 4.5932982e-05 |
| 10,076 | Efficient Size-Bounded Community Search, Revisited: Frameworks for Practical Improvements | 2026 | SIGMOD | 4.1945683e-05 |
| 8,669 | Distributed Set Reachability | 2016 | SIGMOD | 4.4718257e-05 |
| 2,542 | Scalable Discovery of Best Clusters on Large Graphs | 2010 | VLDB | 8.5794502e-05 |
| 3,969 | Efficient Size-Bounded Community Search over Large Networks | 2021 | VLDB | 6.5787567e-05 |
| 9,390 | Efficient Maximum s-Bundle Search via Local Vertex Connectivity | 2025 | SIGMOD | 4.3441378e-05 |