Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts (Q5952050)

From MaRDI portal
Revision as of 10:54, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1687624
Language Label Description Also known as
English
Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts
scientific article; zbMATH DE number 1687624

    Statements

    Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts (English)
    0 references
    0 references
    0 references
    0 references
    8 January 2002
    0 references
    edge weighted undirected graph
    0 references
    approximation algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references