A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs (Q1159467)

From MaRDI portal
Revision as of 02:59, 14 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 polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs
scientific article

    Statements

    A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs (English)
    0 references
    0 references
    1982
    0 references
    packing
    0 references

    Identifiers