Efficient algorithms for the problems of enumerating cuts by non-decreasing weights (Q848944)

From MaRDI portal
Revision as of 05:14, 10 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
Efficient algorithms for the problems of enumerating cuts by non-decreasing weights
scientific article

    Statements

    Efficient algorithms for the problems of enumerating cuts by non-decreasing weights (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 February 2010
    0 references
    algorithms
    0 references
    graphs
    0 references
    minimum cuts
    0 references
    maximum flows
    0 references
    suboptimal cuts
    0 references
    enumeration
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers