Heuristic algorithms for graph set coloring problem (Q5489013)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5056765
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Heuristic algorithms for graph set coloring problem |
scientific article; zbMATH DE number 5056765 |
Statements
25 September 2006
0 references
set chromatic number
0 references
graph colouring
0 references
set colouring
0 references
0.7932952046394348
0 references
0.7929997444152832
0 references
