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

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

FENNEL: streaming graph partitioning for massive scale graphs

Tsourakakis, Charalampos, Gkantsidis, Christos, Radunovic, Bozidar, Vojnovic, Milan · 2014 · Proceedings of the 7th ACM international conference on Web search and data mining

Abstract

Balanced graph partitioning in the streaming setting is a key problem to enable scalable and efficient computations on massive graph data such as web graphs, knowledge graphs, and graphs arising in the context of online social networks. Two families of heuristics for graph partitioning in the streaming setting are in wide use: place the newly arrived vertex in the cluster with the largest number of neighbors or in the cluster with the least number of non-neighbors.

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.1145/2556195.2556213

Cites

46 of 46 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 46 references

Cited by

See all 341

Metadata

Authors
Tsourakakis, C., Gkantsidis, C., Radunovic, B., & Vojnovic, M.
Venue
Proceedings of the 7th ACM international conference on Web search and data mining
Publisher
ACM
Published
2014-02-24
Pages
333-342
OpenAlex
W2006023152
Cited by
341
References
46
FWCI
19.46
Type
conference paper
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: FENNEL: streaming graph partitioning for massive scale graphs. https://app.cochat.ai/papers/10.1145/2556195.2556213
The paper
Tsourakakis, C., Gkantsidis, C., Radunovic, B., & Vojnovic, M. (2014). FENNEL: streaming graph partitioning for massive scale graphs. Proceedings of the 7th ACM international conference on Web search and data mining. https://doi.org/10.1145/2556195.2556213

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.