26 search results - page 6 / 6 » Single Machine Total Weighted Tardiness Problem with Genetic... |
128
click to vote
ICALP
2011
Springer
14 years 28 days ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...