Computing Network Reliability in Time Polynomial in the Number of Cuts (Q3335484)

From MaRDI portal
Revision as of 02:17, 21 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Computing Network Reliability in Time Polynomial in the Number of Cuts
scientific article

    Statements

    Computing Network Reliability in Time Polynomial in the Number of Cuts (English)
    0 references
    0 references
    0 references
    1984
    0 references
    computing network reliability
    0 references
    polynomial algorithm
    0 references
    operating path
    0 references
    stochastic network
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references