A fast algorithm for the maximum clique problem (Q1613374)

From MaRDI portal
Revision as of 22:40, 23 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
A fast algorithm for the maximum clique problem
scientific article

    Statements

    A fast algorithm for the maximum clique problem (English)
    0 references
    29 August 2002
    0 references
    maximum independent set
    0 references
    maximum clique problem
    0 references
    branch-and-bound
    0 references
    random graphs
    0 references
    DIMACS benchmark graphs
    0 references

    Identifiers