An effective heuristic algorithm for sum coloring of graphs (Q1762148)
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: An effective heuristic algorithm for sum coloring of graphs |
scientific article; zbMATH DE number 6107588
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An effective heuristic algorithm for sum coloring of graphs |
scientific article; zbMATH DE number 6107588 |
Statements
An effective heuristic algorithm for sum coloring of graphs (English)
0 references
15 November 2012
0 references
sum coloring
0 references
vertex coloring
0 references
independent set
0 references
heuristics
0 references
heuristic algorithm
0 references
minimum sum coloring problem (MSCP)
0 references
0 references
0.8685300946235657
0 references
0.8622291088104248
0 references
0.8527196645736694
0 references
0.8262163996696472
0 references
0.8231908082962036
0 references
