Finding minimum 3-way cuts in hypergraphs (Q765477)

From MaRDI portal
Revision as of 00:53, 5 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
Finding minimum 3-way cuts in hypergraphs
scientific article

    Statements

    Finding minimum 3-way cuts in hypergraphs (English)
    0 references
    0 references
    19 March 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph algorithms
    0 references
    \(k\)-way cut
    0 references
    edge-weighted hypergraph
    0 references
    minimum 3-way cut problem
    0 references
    0 references