A review on algorithms for maximum clique problems (Q2630214)

From MaRDI portal
Revision as of 08:55, 12 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A review on algorithms for maximum clique problems
scientific article

    Statements

    title
    A review on algorithms for maximum clique problems (English)
    0 references
    author
    Qinghua Wu
    0 references
    Jin-Kao Hao
    0 references
    publication date
    26 July 2016
    0 references
    Mathematics Subject Classification ID
    05C85
    0 references
    90C35
    0 references
    90C59
    0 references
    05-02
    0 references
    90-02
    0 references
    zbMATH DE Number
    6606178
    0 references
    zbMATH Keywords
    maximum clique problems
    0 references
    exact algorithms
    0 references
    heuristics
    0 references
    applications
    0 references
    cites work
    DIMACS
    0 references
    Q3044359
    0 references
    Q3070929
    0 references
    Q4258216
    0 references
    Q5294075
    0 references
    Q3145799
    0 references
    Q4083324
    0 references
    Q4411385
    0 references
    Q5687276
    0 references
    Q5687246
    0 references
    Q2837833
    0 references
    Q5705147
    0 references
    Q4472034
    0 references
    Q3623999
    0 references
    Graph clustering
    0 references
    Q3588651
    0 references
    Q4452109
    0 references
    describes a project that uses
    DIMACS
    0 references
    Max-AO
    0 references
    EXTRACOL
    0 references
    MaxCliqueDyn
    0 references
    Hyperheuristics
    0 references
    QUALEX
    0 references
    OpenAlex ID
    W2037016941
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2630214&oldid=36263698"
    Powered by MediaWiki