Speeding up branch and bound algorithms for solving the maximum clique problem (Q2249809)

From MaRDI portal
Revision as of 08:48, 29 February 2024 by SwMATHimport240215 (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Speeding up branch and bound algorithms for solving the maximum clique problem
scientific article

    Statements

    Speeding up branch and bound algorithms for solving the maximum clique problem (English)
    0 references
    0 references
    0 references
    0 references
    3 July 2014
    0 references
    maximum clique problem
    0 references
    branch and bound algorithm
    0 references
    heuristic solution
    0 references
    graph colouring
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references