Semidefinite programming relaxations for graph coloring and maximal clique problems (Q868457)

From MaRDI portal
Revision as of 15:18, 30 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Semidefinite programming relaxations for graph coloring and maximal clique problems
scientific article

    Statements

    title
    Semidefinite programming relaxations for graph coloring and maximal clique problems (English)
    0 references
    author
    Igor Dukanovic
    0 references
    Franz Rendl
    0 references
    publication date
    5 March 2007
    0 references
    zbMATH Keywords
    Lovász theta number
    0 references
    chromatic number
    0 references
    clique number
    0 references
    cutting planes
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C22
    0 references
    05C15
    0 references
    05C25
    0 references
    05C69
    0 references
    05C85
    0 references
    zbMATH DE Number
    5131068
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q868457&oldid=12813497"
    Powered by MediaWiki