Reference health

Empirical comparison of algorithms for network community detection

https://doi.org/10.1145/1772690.1772755
CiteStamped reference-health badge
1 of 32 checkable references need attention · checked 2026-07-31

At the dated check, the references listed below either did not resolve in Crossref or DataCite, or carried a retraction notice. Each one is shown with the registry record that put it there.

2 without a DOI — not checked. A reference deposited without a DOI is never matched by title or guessed at; it stays outside the checked set, and this line discloses that.

References needing attention

does not resolve to a known work10.5555/874062.875505
The 31 checked references that resolve
resolves10.1109/FOCS.2006.44
Local Graph Partitioning using PageRank Vectors
resolves10.1145/1135777.1135814
Communities from seed sets
resolves10.1145/1007352.1007355
Expander flows, geometric embeddings and graph partitioning
resolves10.1007/s10107-002-0352-8
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
resolves10.1090/cbms/092
Spectral Graph Theory
resolves10.1103/PhysRevE.72.026132
Finding local community structure in networks
resolves10.1103/PhysRevE.70.066111
Finding community structure in very large networks
resolves10.1109/TPAMI.2007.1115
Weighted Graph Cuts without Eigenvectors A Multilevel Approach
resolves10.1145/347090.347121
Efficient identification of Web communities
resolves10.1080/15427951.2004.10129093
Graph Clustering and Minimum Cut Trees
resolves10.1007/978-0-387-30440-3_76
Community Structure in Graphs
resolves10.1073/pnas.0605965104
Resolution limit in community detection
resolves10.1007/978-3-540-31955-9_8
Clustering
resolves10.1137/0218003
A Fast Parametric Maximum Flow Algorithm and Applications
resolves10.1073/pnas.122653799
Community structure in social and biological networks
resolves10.1103/PhysRevE.70.025101
Modularity from fluctuations in random graphs and complex networks
resolves10.1145/990308.990313
On clusterings
resolves10.1103/PhysRevE.77.046119
Robustness of community structure in networks
resolves10.1137/S1064827595287997
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
resolves10.1103/PhysRevE.80.056117
Community detection algorithms: A comparative analysis
resolves10.1007/978-3-540-25960-2_25
A Flow-Based Method for Improving the Expansion or Conductance of Graph Cuts
resolves10.1109/SFCS.1988.21958
An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms
resolves10.1145/331524.331526
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
resolves10.1080/15427951.2009.10129177
Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
resolves10.1145/1367497.1367591
Statistical properties of community structure in large social and information networks
resolves10.1073/pnas.0601602103
Modularity and community structure in networks
resolves10.1103/PhysRevE.69.026113
Finding and evaluating community structure in networks
resolves10.1073/pnas.0400054101
Defining and identifying communities in networks
resolves10.1016/j.cosrev.2007.05.001
Graph clustering
resolves10.1109/34.868688
Normalized cuts and image segmentation
resolves10.1137/1.9781611972757.25
A Spectral Clustering Approach To Finding Communities in Graphs
The 2 references without a DOI — listed, not checked
no DOI — not checkedSupporting website. http://snap.stanford.edu/ncp/. Supporting website. http://snap.stanford.edu/ncp/.
no DOI — not checkedSODA '93: Proceedings of the 4th annual ACM-SIAM Symposium on Discrete algorithms
What this badge says. CiteStamped means the CHECKABLE references of this work were clean at the dated check: each resolved to a known work in a public registry, and none carried a retraction notice at that time. It says nothing about the quality, findings, or importance of the work itself, and nothing about references deposited without a DOI.

checked 2026-07-31 — re-checked daily as this page is visited; titles and statuses come from Crossref and DataCite and are not part of the signed record

Embed this badge

Both snippets point at the live badge image and link back to this page. The badge re-renders from the daily check, so an embed never goes stale by more than a day of visits.

<a href="https://citestamp.com/citestamped/10.1145/1772690.1772755"><img src="https://citestamp.com/citestamped/10.1145/1772690.1772755/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[![CiteStamped reference-health badge](https://citestamp.com/citestamped/10.1145/1772690.1772755/badge.svg)](https://citestamp.com/citestamped/10.1145/1772690.1772755)