Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 590

The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.

A fast algorithm for the maximum clique problem

Open access
Östergård, Patric R.J.·2002·Discrete Applied Mathematics

Abstract

Given a graph, in the maximum clique problem, one desires to find the largest number of vertices, any two of which are adjacent. A branch-and-bound algorithm for the maximum clique problem--which is computationally equivalent to the maximum independent (stable) set problem--is presented with the vertex order taken from a coloring of the vertices and with a new pruning strategy. The algorithm performs successfully for many instances when applied to random graphs and DIMACS benchmark graphs.

Overview

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/s0166-218x(01)00290-6

Cites

4 of 4 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 4 references

Research works printed but not linked: 5

  1. Babel, 1991, Finding maximum cliques in arbitrary and in special graphs, Computing, 46, 321, 10.1007/BF02257777 · doi:10.1007/bf02257777
  2. Balas, 1996, Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring, Algorithmica, 15, 397, 10.1007/BF01955041 · doi:10.1007/bf01955041
  3. Östergå rd, 1999, Optimal binary one-error-correcting codes of length 10 have 72 codewords, IEEE Trans. Inform. Theory, 45, 1229, 10.1109/18.761273 · doi:10.1109/18.761273
  4. Sewell, 1998, A branch and bound algorithm for the stability number of a sparse graph, INFORMS J. Comput., 10, 438, 10.1287/ijoc.10.4.438 · doi:10.1287/ijoc.10.4.438
  5. Wood, 1997, An algorithm for finding a maximum clique in a graph, Oper. Res. Lett., 21, 211, 10.1016/S0167-6377(97)00054-0 · doi:10.1016/s0167-6377(97)00054-0

Cited by

See all 590

Metadata

Authors
Östergård, P. R. J.
Venue
Discrete Applied Mathematics
Publisher
Elsevier BV
Published
2002-08
Volume
120
Issue
1-3
Pages
197-207
ISSN
0166-218X (ISSN-L)
OpenAlex
W2046112356
Cited by
590
References
4
FWCI
12.90
Type
journal article
Language
en
Open access
bronze
Licence

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: A fast algorithm for the maximum clique problem. https://app.cochat.ai/papers/10.1016/s0166-218x(01)00290-6
The paper
Östergård, P. R. J. (2002). A fast algorithm for the maximum clique problem. Discrete Applied Mathematics. https://doi.org/10.1016/s0166-218x(01)00290-6

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.