A semidefinite programming-based heuristic for graph coloring (Q2467349)

From MaRDI portal
Revision as of 01:58, 28 February 2024 by SwMATHimport240215 (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
A semidefinite programming-based heuristic for graph coloring
scientific article

    Statements

    title
    A semidefinite programming-based heuristic for graph coloring (English)
    0 references
    author
    Igor Dukanovic
    0 references
    Franz Rendl
    0 references
    publication date
    21 January 2008
    0 references
    Mathematics Subject Classification ID
    05C15
    0 references
    05C85
    0 references
    90C22
    0 references
    90C27
    0 references
    zbMATH DE Number
    5228810
    0 references
    zbMATH Keywords
    graph (vertex) coloring
    0 references
    Lovász theta number
    0 references
    Lovász theta function
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2467349&oldid=22957047"
    Powered by MediaWiki