Hypergraph \(k\)-cut in randomized polynomial time (Q2227530)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Hypergraph \(k\)-cut in randomized polynomial time
scientific article

    Statements

    Hypergraph \(k\)-cut in randomized polynomial time (English)
    0 references
    0 references
    0 references
    15 February 2021
    0 references
    hypergraph-\(k\)-cut
    0 references
    hedgegraph-\(k\)-cut
    0 references
    randomized algorithm
    0 references
    0 references
    0 references
    0 references

    Identifiers