Partial factoring: an efficient algorithm for approximating two-terminal reliability on complete graphs (Q5202014)

From MaRDI portal
scientific article; zbMATH DE number 4193434
Language Label Description Also known as
English
Partial factoring: an efficient algorithm for approximating two-terminal reliability on complete graphs
scientific article; zbMATH DE number 4193434

    Statements

    Partial factoring: an efficient algorithm for approximating two-terminal reliability on complete graphs (English)
    0 references
    0 references
    0 references
    1990
    0 references
    efficient network reliability approximation algorithm
    0 references

    Identifiers

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