The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
On Finding Graph Clusterings with Maximum Modularity
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Finding and evaluating community structure in networks
Newman, M. E. J., & Girvan, M. (2004) · Physical Review E · doi:10.1103/physreve.69.026113 · Cited by 13,931
Modularity and community structure in networks
Newman, M. E. J. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0601602103 · Cited by 12,256
Resolution limit in community detection
Fortunato, S., & Barthélemy, M. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0605965104 · Cited by 3,024
Modularity from fluctuations in random graphs and complex networks
Guimerà, R., Sales-Pardo, M., & Amaral, L. A. N. (2004) · Physical Review E · doi:10.1103/physreve.70.025101 · Cited by 894
Cited by
Community Structure in Directed Networks
Leicht, E. A., & Newman, M. E. J. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.118703 · Cited by 1,116
Generalized Louvain method for community detection in large networks
De Meo, P., Ferrara, E., Fiumara, G., & Provetti, A. (2011) · 2011 11th International Conference on Intelligent Systems Design and Applications · doi:10.1109/isda.2011.6121636 · Cited by 440
Spectral methods for community detection and graph partitioning
Newman, M. E. J. (2013) · Physical Review E · doi:10.1103/physreve.88.042822 · Cited by 424
Random Walks, Markov Processes and the Multiscale Modular Organization of Complex Networks
Lambiotte, R., Delvenne, J.-C., & Barahona, M. (2014) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2015.2391998 · Cited by 398
Narrow scope for resolution-limit-free community detection
Traag, V. A., Van Dooren, P., & Nesterov, Y. (2011) · Physical Review E · doi:10.1103/physreve.84.016114 · Cited by 353
Metadata
- Authors
- Brandes, U., Delling, D., Gaertler, M., Görke, R., Hoefer, M., Nikoloski, Z., & Wagner, D.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2007-12-06
- Pages
- 121-132
- OpenAlex
- W2160220393
- Cited by
- 182
- References
- 4
- FWCI
- 13.60
- 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: On Finding Graph Clusterings with Maximum Modularity. https://app.cochat.ai/papers/10.1007/978-3-540-74839-7_12
- The paper
- Brandes, U., Delling, D., Gaertler, M., Görke, R., Hoefer, M., Nikoloski, Z., & Wagner, D. (2007). On Finding Graph Clusterings with Maximum Modularity. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-540-74839-7_12
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.