Infra-chromatic bound for exact maximum clique search (Q342100)

From MaRDI portal
Revision as of 00:01, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Infra-chromatic bound for exact maximum clique search
scientific article

    Statements

    title
    Infra-chromatic bound for exact maximum clique search (English)
    0 references
    author
    Pablo San Segundo
    0 references
    Alexey Nikolaev
    0 references
    Mikhail Batsyn
    0 references
    publication date
    17 November 2016
    0 references
    zbMATH Keywords
    approximate coloring
    0 references
    branch-and-bound
    0 references
    MaxSAT
    0 references
    combinatorial optimization
    0 references
    describes a project that uses
    MaxCliqueDyn
    0 references
    biicode
    0 references
    Algorithm 457
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C35
    0 references
    05C85
    0 references
    90C27
    0 references
    zbMATH DE Number
    6654058
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q342100&oldid=25526208"
    Powered by MediaWiki