Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring (Q1913697)

From MaRDI portal
Revision as of 05:23, 29 July 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
Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
scientific article

    Statements

    Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring (English)
    0 references
    0 references
    0 references
    0 references
    27 May 1996
    0 references
    minimum vertex coloring problem
    0 references
    fractional coloring problem
    0 references

    Identifiers