Two generalizations of proper coloring: hardness and approximability (Q6168932)
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 7724735
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two generalizations of proper coloring: hardness and approximability |
scientific article; zbMATH DE number 7724735 |
Statements
Two generalizations of proper coloring: hardness and approximability (English)
0 references
10 August 2023
0 references
coloring
0 references
parameterized complexity
0 references
unit disk graphs
0 references
approximation algorithms
0 references
graph algorithms
0 references
exact algorithms
0 references
0.8937882
0 references
0 references
0.8923205
0 references
0.88850826
0 references
0.88850826
0 references
0.88663423
0 references
0.8861173
0 references
