A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability (Q3716781)

From MaRDI portal
Revision as of 11:21, 18 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability
scientific article

    Statements

    A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability (English)
    0 references
    0 references
    0 references
    1985
    0 references
    undirected graph
    0 references
    Edge failures
    0 references
    K-terminal reliability
    0 references
    factoring algorithm
    0 references
    computing network reliability
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references