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

From MaRDI portal
Revision as of 04:39, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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