Exploiting sparsity for the min \(k\)-partition problem (Q2175445)

From MaRDI portal
Revision as of 07:24, 1 August 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
Exploiting sparsity for the min \(k\)-partition problem
scientific article

    Statements

    Exploiting sparsity for the min \(k\)-partition problem (English)
    0 references
    0 references
    0 references
    29 April 2020
    0 references
    integer programming
    0 references
    graph partitioning
    0 references
    semidefinite programming
    0 references
    chordal graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references