Efficient determination of the transitive closure of a directed graph (Q2547483): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q29042360, #quickstatements; #temporary_batch_1711504539957
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A Theorem on Boolean Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A transitive closure algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5616735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian elimination is not optimal / rank
 
Normal rank

Revision as of 03:36, 12 June 2024

scientific article
Language Label Description Also known as
English
Efficient determination of the transitive closure of a directed graph
scientific article

    Statements

    Efficient determination of the transitive closure of a directed graph (English)
    0 references
    0 references
    1971
    0 references

    Identifiers