A theorem on Boolean matrices

Warshall, S. (1962). A theorem on Boolean matrices. Journal of the ACM, 9(1), 11-12.

Type

Journal article

Intellectual base

Primary research

Year

1962

Volume

9

Issue

1

Pages

11-12

DOI

10.1145/321105.321107

DOI registrant

Association for Computing Machinery

Link

https://doi.org/10.1145/321105.321107

Cited from

mathematics

Cited by

1 citation across 1 artifact.

Each citation links to the sentence it supports in the citing article.

Primes

• Closure
  • Transitive closure is a primitive of graph theory and of recursive query languages (SQL WITH RECURSIVE and Datalog), with the transitive-closure operator computing the smallest transitive relation containing a given relation, an algorithm Warshall (1962) gives in its canonical \(O(n^3)\) form.

    This sourceOriginating presentation of the $O(n^3)$ algorithm for the transitive closure of a binary relation (reachability matrix of a directed graph).

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:5f332db059df · see in the full table