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

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

On Algorithms for Obtaining a Maximum Transversal

Open access
Duff, I. S.·1981·ACM Transactions on Mathematical Software

Abstract

A computer program for obtaining a permutation of a general sparse matrix that places a maxunum number of nonzero elements on its dmgonal is described.The history of this problem and the mare motivatmn for developing the algorithm are briefly chscussed Comments are made on the use of cheap heunstms, and the complexity of the algorithm is examined both in terms of its worst case bound and its performance on typmal examples.Finally, some imtml attempts at implementmg an algomthm with supermr asymptotic complexity are described.

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

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 203

Metadata

Authors
Duff, I. S.
Venue
ACM Transactions on Mathematical Software
Published
1981-09
Volume
7
Issue
3
Pages
315-330
ISSN
  • 0098-3500 (ISSN-L)
  • 1557-7295
OpenAlex
W1972859808
Cited by
203
References
1
FWCI
6.82
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: On Algorithms for Obtaining a Maximum Transversal. https://app.cochat.ai/papers/10.1145/355958.355963
The paper
Duff, I. S. (1981). On Algorithms for Obtaining a Maximum Transversal. ACM Transactions on Mathematical Software. https://doi.org/10.1145/355958.355963

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.