An algorithm for finding the transitive closure of a digraph (Q1225062)

From MaRDI portal
Revision as of 07:16, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
An algorithm for finding the transitive closure of a digraph
scientific article

    Statements

    title
    An algorithm for finding the transitive closure of a digraph (English)
    0 references
    author
    J. Dzikiewicz
    0 references
    published in
    Computing
    0 references
    publication date
    1975
    0 references

    Identifiers

    DOI
    10.1007/BF02252839
    0 references
    Mathematics Subject Classification ID
    05-04
    0 references
    68W99
    0 references
    05C20
    0 references
    zbMATH DE Number
    3508527
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1225062&oldid=13299950"
    Powered by MediaWiki