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

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

On maximum clique problems in very large graphs

Abello, J., Pardalos, Panos, Resende, M.·1999·DIMACS Series in Discrete Mathematics and Theoretical Computer Science

Abstract

. We present an approach for clique and quasi-clique computations in very large multi-digraphs. We discuss graph decomposition schemes used to break up the problem into several pieces of manageable dimensions. A semiexternal greedy randomized adaptive search procedure (GRASP) for finding approximate solutions to the maximum clique problem and maximum quasiclique problem in very large sparse graphs is presented. We experiment with this heuristic on real data sets collected in the telecommunications industry. These graphs contain on the order of millions of vertices and edges. 1. Introduction The proliferation of massive data sets brings with it a series of special computational challenges. Many of these data sets can be modeled as very large multidigraphs M with a special set of edge attributes that represent special characteristics of the application at hand [1]. Understanding the structure of the underlying digraph D(M) is essential for storage organization and information retrieval...

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.1090/dimacs/050/06

Cites

1 of 1 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 1 references

Cited by

See all 221

Metadata

Authors
Abello, J., Pardalos, P., & Resende, M.
Venue
DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Published
1999-11-30
Pages
119-130
ISSN
  • 1052-1798 (ISSN-L)
  • 2472-4793
OpenAlex
W106934005
Cited by
221
References
1
FWCI
7.48
Type
book chapter
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: On maximum clique problems in very large graphs. https://app.cochat.ai/papers/10.1090/dimacs/050/06
The paper
Abello, J., Pardalos, P., & Resende, M. (1999). On maximum clique problems in very large graphs. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. https://doi.org/10.1090/dimacs/050/06

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.