Efficient algorithms for minimum weighted colouring of some classes of perfect graphs (Q1339397)
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: Efficient algorithms for minimum weighted colouring of some classes of perfect graphs |
scientific article; zbMATH DE number 699144
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for minimum weighted colouring of some classes of perfect graphs |
scientific article; zbMATH DE number 699144 |
Statements
Efficient algorithms for minimum weighted colouring of some classes of perfect graphs (English)
0 references
5 July 1995
0 references
comparability graph
0 references
polynomial algorithm
0 references
0.8589279651641846
0 references
0.8440590500831604
0 references
0.8273230195045471
0 references
