Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization (Q3629508)

From MaRDI portal
Revision as of 19:00, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization
scientific article

    Statements

    Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization (English)
    0 references
    0 references
    0 references
    27 May 2009
    0 references
    chromatic number
    0 references
    Lovász theta number
    0 references
    semidefinite programming
    0 references
    Terwilliger algebra
    0 references
    Hamming graph
    0 references
    Kneser graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references