A 1-local 4/3-competitive algorithm for multicoloring a subclass of hexagonal graphs (Q496697)
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 1-local 4/3-competitive algorithm for multicoloring a subclass of hexagonal graphs |
scientific article; zbMATH DE number 6484209
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A 1-local 4/3-competitive algorithm for multicoloring a subclass of hexagonal graphs |
scientific article; zbMATH DE number 6484209 |
Statements
A 1-local 4/3-competitive algorithm for multicoloring a subclass of hexagonal graphs (English)
0 references
22 September 2015
0 references
hexagonal graphs
0 references
multicoloring
0 references
algorithm
0 references
frequency assignment problem
0 references
FAP
0 references
0.9761993885040284
0 references
0.9761982560157776
0 references
0.976177215576172
0 references
0.9760723114013672
0 references
0.9659768342971802
0 references
