Generating partitions of a graph into a fixed number of minimum weight cuts (Q1952501)

From MaRDI portal
Revision as of 17:51, 29 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Generating partitions of a graph into a fixed number of minimum weight cuts
scientific article

    Statements

    Generating partitions of a graph into a fixed number of minimum weight cuts (English)
    0 references
    0 references
    0 references
    31 May 2013
    0 references
    mincut
    0 references
    graph partitioning
    0 references
    cactus
    0 references
    traveling salesman problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references