The strongly connected reliability of complete digraphs (Q4680417)

From MaRDI portal
Revision as of 17:55, 2 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 2173327
Language Label Description Also known as
English
The strongly connected reliability of complete digraphs
scientific article; zbMATH DE number 2173327

    Statements

    The strongly connected reliability of complete digraphs (English)
    0 references
    0 references
    0 references
    0 references
    1 June 2005
    0 references
    algorithm
    0 references
    reachability
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references