A sequential elimination algorithm for computing bounds on the clique number of a graph (Q937406)

From MaRDI portal
Revision as of 16:07, 7 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 sequential elimination algorithm for computing bounds on the clique number of a graph
scientific article

    Statements

    A sequential elimination algorithm for computing bounds on the clique number of a graph (English)
    0 references
    0 references
    0 references
    0 references
    15 August 2008
    0 references
    maximum clique
    0 references
    clique number
    0 references
    upper bounds
    0 references
    lower bounds
    0 references
    sequential elimination algorithm
    0 references

    Identifiers