2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs (Q2390258)
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 5581133
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | 2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs |
scientific article; zbMATH DE number 5581133 |
Statements
2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs (English)
0 references
21 July 2009
0 references
graph algorithms
0 references
approximation algorithms
0 references
graph coloring
0 references
frequency planning
0 references
cellular networks
0 references
2-local distributed algorithms
0 references
0 references
0.9847293496131896
0 references
0.9803217053413392
0 references
0.9790574908256532
0 references
0.9448737502098083
0 references
0.9397056102752686
0 references
