Simple heuristics for unit disk graphs (Q4698229)
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: Simple heuristics for unit disk graphs |
scientific article; zbMATH DE number 755103
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simple heuristics for unit disk graphs |
scientific article; zbMATH DE number 755103 |
Statements
Simple heuristics for unit disk graphs (English)
0 references
12 June 1995
0 references
unit disk graphs
0 references
maximum independent set
0 references
minimum vertex cover
0 references
minimum coloring
0 references
minimum dominating set
0 references
on-line coloring heuristic
0 references
0.9161393
0 references
0.9010253
0 references
0.8745025
0 references
0.87093854
0 references
0.86861265
0 references
0.86809164
0 references
0.8680419
0 references
