The More the Merrier: Efficient Multi-Source Graph Traversal
Summary: MS-BFS runs many concurrent BFSs on one graph by sharing work and reducing memory accesses, exploiting small-world properties to avoid synchronization. It achieves near-linear core scalability on real graphs (Twitter, Wikipedia) and outperforms prior BFS for many sources, enabling all-vertices closeness centrality. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Manuel Then (Technical University of Munich)
- 2. Kien Pham (New York University)
- 3. Moritz Kaufmann (Technical University of Munich)
- 4. Alfons Kemper (Technical University of Munich)
- 5. Fernando Chirigati (New York University)
- 6. Tuan-Anh Hoang-Vu (New York University)
- 7. Thomas Neumann (Technical University of Munich)
- 8. Huy T. Vo (New York University)
BibTeX Citation
@article{then_vldb15,
title = {{The More the Merrier: Efficient Multi-Source Graph Traversal}},
author = {Then, Manuel and Pham, Kien and Kaufmann, Moritz and Kemper, Alfons and Chirigati, Fernando and Hoang-Vu, Tuan-Anh and Neumann, Thomas and Vo, Huy T.},
journal = {PVLDB},
series = {{VLDB} '15},
volume = {8},
number = {4},
pages = {449},
doi = {10.14778/2735496.2735507},
url = {https://doi.org/10.14778/2735496.2735507},
year = {2015}
}Incoming Citations (Sorted by Pagerank)
Showing 20 of 20 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 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.0012092602 |
| 22 | Distributed GraphLab: A Framework for Machine Learning and Data Mining in the Cloud | 2012 | VLDB | 0.00055962491 |
| 444 | Trinity: A Distributed Graph Engine on a Memory Cloud | 2013 | SIGMOD | 0.00018177351 |
| 2,512 | Large-Scale Graph Analytics in Aster 6: Bringing Context to Big Data Discovery | 2014 | VLDB | 8.3689316e-05 |
| 2,604 | K-Reach: Who is in Your Small World | 2012 | VLDB | 8.2302549e-05 |
| 3,066 | Scalable Big Graph Processing in MapReduce | 2014 | SIGMOD | 7.6877117e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,420 | Beyond Maximum Common Subgraph: A Framework Maximizing Shared Computation for Multi-Query Subgraph Matching | 2026 | SIGMOD |
| 2 | 3,066 | Scalable Big Graph Processing in MapReduce | 2014 | SIGMOD |
| 3 | 758 | Streaming Algorithms for k-core Decomposition | 2013 | VLDB |
| 4 | 5,629 | Efficient Core Maintenance in Large Bipartite Graphs | 2023 | SIGMOD |
| 5 | 6,651 | Efficient Parallel D-core Decomposition at Scale | 2024 | VLDB |
| 6 | 4,091 | When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks | 2017 | VLDB |
| 7 | 2,054 | Space Efficient Mining of Multigraph Streams | 2005 | PODS |
| 8 | 10,665 | Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs | 2026 | SIGMOD |
| 9 | 2,789 | iBFS: Concurrent Breadth-First Search on GPUs | 2016 | SIGMOD |
| 10 | 11,599 | Efficient Betweenness Centrality Computation over Large Heterogeneous Information Networks | 2024 | VLDB |