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

From MaRDI portal
Revision as of 15:03, 1 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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