Methods of finding all minimum coverings of a graph by cliques (Q1903945)

From MaRDI portal
Revision as of 02:58, 29 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
Methods of finding all minimum coverings of a graph by cliques
scientific article

    Statements

    Methods of finding all minimum coverings of a graph by cliques (English)
    0 references
    0 references
    0 references
    7 March 1996
    0 references
    0 references
    bichromatic graph algorithm
    0 references
    scanning methods
    0 references