An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem (Q2967612)

From MaRDI portal
Revision as of 18:06, 25 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
An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem
scientific article

    Statements

    An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem (English)
    0 references
    0 references
    1 March 2017
    0 references
    graph partition
    0 references
    graph equipartition
    0 references
    matrix lifting
    0 references
    vector lifting
    0 references
    semidefinite programming
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references