An <i>O</i>(|<i>E</i>|) Time Algorithm for Computing the Reliability of a Class of Directed Networks (Q3335483)

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
An <i>O</i>(|<i>E</i>|) Time Algorithm for Computing the Reliability of a Class of Directed Networks
scientific article

    Statements

    An <i>O</i>(|<i>E</i>|) Time Algorithm for Computing the Reliability of a Class of Directed Networks (English)
    0 references
    1984
    0 references
    source-to-terminal reliability
    0 references
    reliability-preserving reductions
    0 references
    directed networks
    0 references
    polynomial time algorithms
    0 references

    Identifiers

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