On the use of some known methods for \(T\)-colorings of graphs (Q2367012)
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 232548
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the use of some known methods for \(T\)-colorings of graphs |
scientific article; zbMATH DE number 232548 |
Statements
On the use of some known methods for \(T\)-colorings of graphs (English)
0 references
16 August 1993
0 references
frequency assignment
0 references
heuristic procedure
0 references
graph coloring
0 references
tabu search
0 references
simulated annealing
0 references
branch-and-bound algorithm
0 references
0 references
0 references
0 references
0.9152406
0 references
0 references
0 references
0.89185536
0 references
0.8911919
0 references
0.8907273
0 references
