The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
The worst-case time complexity for generating all maximal cliques and computational experiments
Open accessOverview
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.
Integrity signals
Registry
Cites
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.
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
Algorithm 457: finding all cliques of an undirected graph
Bron, C., & Kerbosch, J. (1973) · Communications of the ACM · doi:10.1145/362342.362367 · Cited by 2,452
Bomze, I. M., Budinich, M., Pardalos, P. M., & Pelillo, M. (1999) · Handbook of Combinatorial Optimization · doi:10.1007/978-1-4757-3023-4_1 · Cited by 1,148
Moon, J. W., & Moser, L. (1965) · Israel Journal of Mathematics · doi:10.1007/bf02760024 · Cited by 837
Hattori, M., Okuno, Y., Goto, S., & Kanehisa, M. (2003) · Journal of the American Chemical Society · doi:10.1021/ja036030u · Cited by 484
Cliques, Coloring, and Satisfiability
(1996) · DIMACS Series in Discrete Mathematics and Theoretical Computer Science · doi:10.1090/dimacs/026 · Cited by 476
Finding a Maximum Independent Set
Tarjan, R. E., & Trojanowski, A. E. (1977) · SIAM Journal on Computing · doi:10.1137/0206038 · Cited by 474
New Algorithms for Enumerating All Maximal Cliques
Makino, K., & Uno, T. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-27810-8_23 · Cited by 405
Pardalos, P. M., & Xue, J. (1994) · Journal of Global Optimization · doi:10.1007/bf01098364 · Cited by 382
Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
Lawler, E. L., Lenstra, J. K., & Kan, A. H. G. R. (1980) · SIAM Journal on Computing · doi:10.1137/0209042 · Cited by 285
Enumerating all connected maximal common subgraphs in two graphs
Koch, I. (2001) · Theoretical Computer Science · doi:10.1016/s0304-3975(00)00286-3 · Cited by 243
Cited by
The Variational Quantum Eigensolver: A review of methods and best practices
Tilly, J., Chen, H., Cao, S., Picozzi, D., Setia, K., Li, Y., Grant, E., Wossnig, L., Rungger, I., Booth, G. H., et al. (2022) · Physics Reports · doi:10.1016/j.physrep.2022.08.003 · Cited by 1,031
Complex discovery from weighted PPI networks
Liu, G., Wong, L., & Chua, H. N. (2009) · Bioinformatics · doi:10.1093/bioinformatics/btp311 · Cited by 470
Computational approaches for detecting protein complexes from protein interaction networks: a survey
Li, X., Wu, M., Kwoh, C.-K., & Ng, S.-K. (2010) · BMC Genomics · doi:10.1186/1471-2164-11-s1-s3 · Cited by 349
Measurement optimization in the variational quantum eigensolver using a minimum clique cover
Verteletskyi, V., Yen, T.-C., & Izmaylov, A. F. (2020) · The Journal of Chemical Physics · doi:10.1063/1.5141458 · Cited by 269
Yen, T.-C., Verteletskyi, V., & Izmaylov, A. F. (2020) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.0c00008 · Cited by 178
Metadata
- Authors
- Tomita, E., Tanaka, A., & Takahashi, H.
- Venue
- Theoretical Computer Science
- Publisher
- Elsevier BV
- Published
- 2006-10
- Volume
- 363
- Issue
- 1
- Pages
- 28-42
- ISSN
- 0304-3975 (ISSN-L)
- OpenAlex
- W2160429376
- Cited by
- 771
- References
- 10
- FWCI
- 12.98
- Type
- journal article
- Language
- en
- Open access
- bronze
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: The worst-case time complexity for generating all maximal cliques and computational experiments. https://app.cochat.ai/papers/10.1016/j.tcs.2006.06.015
- The paper
- Tomita, E., Tanaka, A., & Takahashi, H. (2006). The worst-case time complexity for generating all maximal cliques and computational experiments. Theoretical Computer Science. https://doi.org/10.1016/j.tcs.2006.06.015
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.
