A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs (Q1159467): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:39, 31 January 2024
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
1982
0 references
packing
0 references
