On comparing algorithms for the maximum clique problem (Q1671301)

From MaRDI portal
Revision as of 13:10, 16 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
On comparing algorithms for the maximum clique problem
scientific article

    Statements

    title
    On comparing algorithms for the maximum clique problem (English)
    0 references
    author
    Alexandre Prusch Züge
    0 references
    Renato Carmo
    0 references
    publication date
    6 September 2018
    0 references
    zbMATH Keywords
    maximum clique
    0 references
    experimental algorithms
    0 references
    random graphs
    0 references
    branch and bound
    0 references
    describes a project that uses
    MaxCliqueDyn
    0 references
    DIMACS
    0 references
    BHOSLIB
    0 references
    BBMCL
    0 references
    BBMCW
    0 references
    cites work
    Q4252727
    0 references
    Q2743189
    0 references
    Q3145799
    0 references
    Q4411385
    0 references
    Q3396567
    0 references
    Measure and conquer
    0 references
    Q4198056
    0 references
    Q2837833
    0 references
    Q4234989
    0 references
    On cliques in graphs
    0 references
    Q4452109
    0 references
    Q4414647
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C85
    0 references
    05C69
    0 references
    05C35
    0 references
    05C80
    0 references
    zbMATH DE Number
    6933493
    0 references
    OpenAlex ID
    W2791564233
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1671301&oldid=36424798"
    Powered by MediaWiki