Finding a Maximum Clique in an Arbitrary Graph (Q3741641)

From MaRDI portal
Revision as of 16:30, 18 October 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
Finding a Maximum Clique in an Arbitrary Graph
scientific article

    Statements

    Finding a Maximum Clique in an Arbitrary Graph (English)
    0 references
    0 references
    0 references
    1986
    0 references
    vertex packing
    0 references
    triangulated subgraphs
    0 references
    k-chromatic subgraphs
    0 references
    implicit enumeration
    0 references
    maximum clique
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references