A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs (Q1159467)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs |
scientific article; zbMATH DE number 3746448
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs |
scientific article; zbMATH DE number 3746448 |
Statements
A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs (English)
0 references
1982
0 references
packing
0 references
0 references
0 references
