Densest Subgraph in Streaming and MapReduce
Summary: Streaming algorithms for densest subgraph use O(log_{1+ε} n) passes and achieve a 2(1+ε)-approximation, while mapping naturally to parallel MapReduce. Extensive experiments on massive real graphs demonstrate practical scalability. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Bahman Bahmani (Stanford University)
- 2. Ravi Kumar (Yahoo)
- 3. Sergei Vassilvitskii (Yahoo)
BibTeX Citation
@article{bahmani_vldb12,
title = {{Densest Subgraph in Streaming and MapReduce}},
author = {Bahmani, Bahman and Kumar, Ravi and Vassilvitskii, Sergei},
journal = {PVLDB},
series = {{VLDB} '12},
volume = {5},
number = {5},
pages = {454},
doi = {10.14778/2140436.2140442},
url = {https://doi.org/10.14778/2140436.2140442},
year = {2012}
}Incoming Citations (Sorted by Pagerank)
Showing 28 of 28 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 131 | Discovering Large Dense Subgraphs in Massive Graphs | 2005 | VLDB | 0.00030242586 |
| 274 | 3-HOP: A High-Compression Indexing Scheme for Reachability Query | 2009 | SIGMOD | 0.00022490994 |
| 2,899 | Social Content Matching in MapReduce | 2011 | VLDB | 7.8847529e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 758 | Streaming Algorithms for k-core Decomposition | 2013 | VLDB |
| 2 | 10,256 | Integral Densest Subgraph Search on Directed Graphs | 2025 | SIGMOD |
| 3 | 10,808 | Efficient Locally h-Clique Densest Subgraph Discovery via Divide-and-Conquer | 2026 | VLDB |
| 4 | 10,421 | Bound-Tightened Densest Subgraph Discovery on GPU | 2026 | SIGMOD |
| 5 | 4,358 | Anchored Densest Subgraph | 2022 | SIGMOD |
| 6 | 4,320 | On Dense Pattern Mining in Graph Streams | 2010 | VLDB |
| 7 | 3,064 | Finding Locally Densest Subgraphs: A Convex Programming Approach | 2022 | VLDB |
| 8 | 9,915 | Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs | 2024 | VLDB |
| 9 | 3,789 | Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs | 2020 | SIGMOD |
| 10 | 2,042 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB |