Bonding Vertex Sets Over Distributed Graph: A Betweenness Aware Approach
Summary: Defines Vertex Set Bonding (VSB): finding a minimum, highly betweenness-central vertex set connecting two vertex sets via shortest-path reachability—an NP-hard graph query. A shared-nothing framework combines guided exploration with exploration-time betweenness ranking for bounded-error, bounded-space near-real-time evaluation at scale. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Xiaofei Zhang (Hong Kong University of Science and Technology)
- 2. Hong Cheng (Chinese University of Hong Kong)
- 3. Lei Chen (Hong Kong University of Science and Technology)
BibTeX Citation
@article{zhang_vldb15,
title = {{Bonding Vertex Sets Over Distributed Graph: A Betweenness Aware Approach}},
author = {Zhang, Xiaofei and Cheng, Hong and Chen, Lei},
journal = {PVLDB},
series = {{VLDB} '15},
volume = {8},
number = {12},
doi = {10.14778/2824032.2824041},
url = {https://doi.org/10.14778/2824032.2824041},
year = {2015}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,418 | Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale | 2022 | VLDB | 5.6236086e-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 |
|---|---|---|---|---|
| 3 | Pregel: A System for Large-Scale Graph Processing | 2010 | SIGMOD | 0.0012250108 |
| 937 | Blogel: A Block-Centric Framework for Distributed Computation on Real-World Graphs | 2014 | VLDB | 0.00013091546 |
| 1,386 | On k-skip Shortest Paths | 2011 | SIGMOD | 0.00010950754 |
| 1,983 | Pregelix: Big(ger) Graph Analytics on A Dataflow Engine | 2015 | VLDB | 9.3544951e-05 |
| 3,415 | On k-Path Covers and their Applications | 2014 | VLDB | 7.4313072e-05 |
| 4,474 | Querying Big Graphs within Bounded Resources | 2014 | SIGMOD | 6.6803983e-05 |
| 7,211 | Toward a Distance Oracle for Billion-Node Graphs | 2014 | VLDB | 5.6719349e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,029 | Performance Guarantees for Distributed Reachability Queries | 2012 | VLDB |
| 2 | 5,370 | Diversified Top-k Subgraph Querying in a Large Graph | 2016 | SIGMOD |
| 3 | 11,271 | Efficient Betweenness Centrality Computation over Large Heterogeneous Information Networks | 2024 | VLDB |
| 4 | 5,581 | Subgraph Matching over Graph Federation | 2022 | VLDB |
| 5 | 8,245 | The shortest path is not always a straight line: Leveraging semi-metricity in graph analysis | 2016 | VLDB |
| 6 | 10,367 | Efficient Size-Bounded Community Search, Revisited: Frameworks for Practical Improvements | 2026 | SIGMOD |
| 7 | 8,651 | Distributed Set Reachability | 2016 | SIGMOD |
| 8 | 3,511 | Scalable Discovery of Best Clusters on Large Graphs | 2010 | VLDB |
| 9 | 3,395 | Efficient Size-Bounded Community Search over Large Networks | 2021 | VLDB |
| 10 | 9,540 | Efficient Maximum s-Bundle Search via Local Vertex Connectivity | 2025 | SIGMOD |