Listing All Maximal Cliques in Large Sparse Real-World Graphs
The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
research-article Share on Listing All Maximal Cliques in Large Sparse Real-World Graphs Authors: David Eppstein University of California, Irvine University of California, IrvineView Profile , Maarten Löffler Utrecht University Utrecht UniversityView Profile , Darren Strash University of California, Irvine University of California, IrvineView Profile Authors Info & Claims ACM Journal of Experimental AlgorithmicsVolume 182013 Article No.: 3.1pp 3.1–3.21https://doi.org/10.1145/2543629Published:28 November 2013Publication History 86citation824DownloadsMetricsTotal Citations86Total Downloads824Last 12 Months114Last 6 weeks9 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
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
Community structure in social and biological networks
Girvan, M., & Newman, M. E. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.122653799 · Cited by 15,502 · cited 1×
“01 football [15] 115 613 8 281 < 0.”
BioGRID: a general repository for interaction datasets
Stark, C. (2006) · Nucleic Acids Research · doi:10.1093/nar/gkj109 · Cited by 3,960 · cited 2×
“Experimental results for BioGRID data sets (PPI Networks)[44].”
MethodThe political blogosphere and the 2004 U.S. election: divided they blog
Adamic, L. A., & Glance, N. (2005) · Proceedings of the 3rd international workshop on Link discovery · doi:10.1145/1134271.1134277 · Cited by 2,619
Studying Complex Discursive Systems..: Centering Resonance Analysis of Communication
Corman, S. R., Kuhn, T., Mcphee, R. D., & Dooley, K. J. (2002) · Human Communication Research · doi:10.1111/j.1468-2958.2002.tb00802.x · Cited by 274
The tidy set: a minimal simplicial set for computing homology of clique complexes
Zomorodian, A. (2010) · Proceedings of the twenty-sixth annual symposium on Computational geometry · doi:10.1145/1810959.1811004 · Cited by 52 · cited 1×
“Other applications of clique finding problems include information retrieval [5], computer vision [20], computational topology [50], and e-commerce [49].”
Cited by
The Anatomy of the Facebook Social Graph
Ugander, J., Karrer, B., Backstrom, L., & Marlow, C. (2011) · arXiv · doi:10.48550/arxiv.1111.4503 · Cited by 819
“In contrast, Eppstein and Strash recently examined the degeneracy of several graphs, both social and non-social, and found that across the entire graphs (not examining only neighborhoods), the degeneracies were much more modest [29].”
Background
Metadata
- Authors
- Eppstein, D., Löffler, M., & Strash, D.
- Venue
- ACM Journal of Experimental Algorithmics
- Published
- 2013-11-28
- Volume
- 18
- ISSN
- 1084-6654 (ISSN-L)
- OpenAlex
- W1485742133
- Cited by
- 221
- References
- 5
- FWCI
- 13.75
- 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: Listing All Maximal Cliques in Large Sparse Real-World Graphs. https://app.cochat.ai/papers/10.1145/2543629
- The paper
- Eppstein, D., Löffler, M., & Strash, D. (2013). Listing All Maximal Cliques in Large Sparse Real-World Graphs. ACM Journal of Experimental Algorithmics. https://doi.org/10.1145/2543629
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.