An algorithm for finding a maximum clique in a graph (Q1267190)

From MaRDI portal
Revision as of 00:38, 1 March 2024 by SwMATHimport240215 (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
An algorithm for finding a maximum clique in a graph
scientific article

    Statements

    An algorithm for finding a maximum clique in a graph (English)
    0 references
    0 references
    6 October 1998
    0 references
    graph algorithm
    0 references
    maximum clique problem
    0 references
    branch-and-bound algorithm
    0 references
    vertex coloring
    0 references
    fractional coloring
    0 references
    0 references
    0 references

    Identifiers