The DOI matches its Crossref record.
Greedily Finding a Dense Subgraph
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
Cited by
Greedy Approximation Algorithms for Finding Dense Components in a Graph
Charikar, M. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44436-x_10 · Cited by 479
Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees
Tsourakakis, C., Bonchi, F., Gionis, A., Gullo, F., & Tsiarli, M. (2013) · Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2487575.2487645 · Cited by 294
Information-Theoretic Feature Selection in Microarray Data Using Variable Complementarity
Meyer, P. E., Schretter, C., & Bontempi, G. (2008) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2008.923858 · Cited by 280
Composite Retrieval of Diverse and Complementary Bundles
Amer-Yahia, S., Bonchi, F., Castillo, C., Feuerstein, E., Mendez-Diaz, I., & Zabala, P. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2014.2306678 · Cited by 42
Metadata
- Authors
- Asahiro, Y., Iwama, K., Tamaki, H., & Tokuyama, T.
- Venue
- Journal of Algorithms
- Publisher
- Elsevier BV
- Published
- 2000-02
- Volume
- 34
- Issue
- 2
- Pages
- 203-221
- ISSN
- 0196-6774 (ISSN-L)
- OpenAlex
- W2032279394
- Cited by
- 211
- References
- 0
- FWCI
- 3.60
- 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: Greedily Finding a Dense Subgraph. https://app.cochat.ai/papers/10.1006/jagm.1999.1062
- The paper
- Asahiro, Y., Iwama, K., Tamaki, H., & Tokuyama, T. (2000). Greedily Finding a Dense Subgraph. Journal of Algorithms. https://doi.org/10.1006/jagm.1999.1062
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.