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

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

A graph coloring algorithm for large scheduling problems

Open access
Leighton, F.T. · 1979 · Journal of Research of the National Bureau of Standards

Abstract

A ne w graph coloring algorit hm is prese nt ed and compared to a wide variety of known algorit hms.The algorithm is shown to exhibit O(n 2) time be havior for most s parse graphs and thus is found to be parti cularl y well s uited for use wi th large-scale sc heduling problems.In addition, a procedure for ge nerating large random test graphs with known chromatic number is present ed and is used to e valu ate he uri sti call y the capabiliti es of the a lgorithms discussed.

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.

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

Integrity signals

Registry

Crossref · 10.6028/jres.084.024

Cites

3 of 3 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.

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.

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 3 references

Cited by

See all 491

Metadata

Authors
Leighton, F. T.
Venue
Journal of Research of the National Bureau of Standards
Published
1979-11
Volume
84
Issue
6
Pages
489
ISSN
0160-1741 (ISSN-L)
OpenAlex
W2324827308
Cited by
491
References
3
FWCI
0.00
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: A graph coloring algorithm for large scheduling problems. https://app.cochat.ai/papers/10.6028/jres.084.024
The paper
Leighton, F. T. (1979). A graph coloring algorithm for large scheduling problems. Journal of Research of the National Bureau of Standards. https://doi.org/10.6028/jres.084.024

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.