An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments (Q868636)

From MaRDI portal
scientific article
Language Label Description Also known as
English
An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
scientific article

    Statements

    An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments (English)
    0 references
    0 references
    0 references
    6 March 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    Maximum clique
    0 references
    Algorithm
    0 references
    Branch-and-bound
    0 references
    Approximate coloring
    0 references
    Computational experiments
    0 references
    0 references
    0 references