CoChat

A Linear Time Algorithm for Deciding Interval Graph Isomorphism

Open access
Lueker, George S., Booth, Kellogg S. · 1979 · Journal of the ACM
Cited by 192

The DOI matches its Crossref record.

Abstract

A graph is an interval graph tf and only if each of Its verttces can be associated with an interval on the real hne m such a way that two vertices are adjacent m the graph exactly when the corresponding mtervals have a nonempty mtersectmn An effictent algonthrn for testing tsomorpinsm of interval graphs ts unplemented using a data structure called a PQ-tree.The algorithm runs m O(n + e) steps for graphs having n vemces and e edges It is shown that for a somewhat larger class of graphs, namely the chordal graphs, lsomorpinsm is as hard as for general graphs KEY WORDS AND PHRASES graph tsomorpinsm algonthms, polynomial reduclinhty, intersection graphs, interval graphs, chordal graphs, ngtd clrcmt graphs CR CATEGORIES. 5 25, 5.32 Permission to copy without fee all or part of tins material ,s granted provtded that the

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.1145/322123.322125

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.

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

Cited by

See all 192

Metadata

Authors
Lueker, G. S., & Booth, K. S.
Venue
Journal of the ACM
Published
1979-04
Volume
26
Issue
2
Pages
183-195
ISSN
  • 0004-5411 (ISSN-L)
  • 1557-735X
OpenAlex
W2089081330
Cited by
192
References
0
FWCI
5.60
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 Linear Time Algorithm for Deciding Interval Graph Isomorphism. https://app.cochat.ai/papers/10.1145/322123.322125
The paper
Lueker, G. S., & Booth, K. S. (1979). A Linear Time Algorithm for Deciding Interval Graph Isomorphism. Journal of the ACM. https://doi.org/10.1145/322123.322125

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.