Unbalanced graph cuts with minimum capacity (Q2515430)

From MaRDI portal
Revision as of 15:40, 10 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Unbalanced graph cuts with minimum capacity
scientific article

    Statements

    Unbalanced graph cuts with minimum capacity (English)
    0 references
    0 references
    5 August 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    unbalanced cut
    0 references
    min cut
    0 references
    approximation algorithm
    0 references
    social network
    0 references
    combinatorial optimization
    0 references
    0 references