A heuristic approach for searching \((d, n)\)-packing colorings of infinite lattices (Q1730261)
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 heuristic approach for searching (d, n)-packing colorings of infinite lattices |
scientific article; zbMATH DE number 7034238
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A heuristic approach for searching \((d, n)\)-packing colorings of infinite lattices |
scientific article; zbMATH DE number 7034238 |
Statements
A heuristic approach for searching \((d, n)\)-packing colorings of infinite lattices (English)
0 references
11 March 2019
0 references
graph algorithm
0 references
heuristic algorithm
0 references
packing coloring
0 references
infinite lattice
0 references
0.8975937366485596
0 references
0.8440588712692261
0 references
0.8217191100120544
0 references
0.7876604199409485
0 references
0.7875844836235046
0 references
