Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 219

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Densest subgraph in streaming and MapReduce

Bahmani, Bahman, Kumar, Ravi, Vassilvitskii, Sergei·2012·Proceedings of the VLDB Endowment

Abstract

The problem of finding locally dense components of a graph is an important primitive in data analysis, with wide-ranging applications from community mining to spam detection and the discovery of biological network modules. In this paper we present new algorithms for finding the densest subgraph in the streaming model. For any ε > 0, our algorithms make O (log 1+ε n ) passes over the input and find a subgraph whose density is guaranteed to be within a factor 2(1 + ε) of the optimum. Our algorithms are also easily parallelizable and we illustrate this by realizing them in the MapReduce model. In addition we perform extensive experimental evaluation on massive real-world graphs showing the performance and scalability of our algorithms in practice.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.14778/2140436.2140442

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 1 references

Cited by

See all 219

Metadata

Authors
Bahmani, B., Kumar, R., & Vassilvitskii, S.
Venue
Proceedings of the VLDB Endowment
Published
2012-01
Volume
5
Issue
5
Pages
454-465
ISSN
2150-8097 (ISSN-L)
OpenAlex
W2051109346
Cited by
219
References
1
FWCI
19.67
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Densest subgraph in streaming and MapReduce. https://app.cochat.ai/papers/10.14778/2140436.2140442
The paper
Bahmani, B., Kumar, R., & Vassilvitskii, S. (2012). Densest subgraph in streaming and MapReduce. Proceedings of the VLDB Endowment. https://doi.org/10.14778/2140436.2140442

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.