A novel minimal cut-based algorithm to find all minimal capacity vectors for multi-state flow networks (Q2286903)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A novel minimal cut-based algorithm to find all minimal capacity vectors for multi-state flow networks
scientific article

    Statements

    A novel minimal cut-based algorithm to find all minimal capacity vectors for multi-state flow networks (English)
    0 references
    0 references
    0 references
    0 references
    23 January 2020
    0 references
    reliability
    0 references
    \(d\)-MP
    0 references
    minimal cuts
    0 references
    multi-state flow network
    0 references
    parallel computing
    0 references

    Identifiers