98 search results - page 8 / 20 » An agent-based algorithm for generalized graph colorings |
112
click to vote
IPL
2008
15 years 4 months ago
2008
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
124
click to vote
WAOA
2005
Springer
15 years 9 months ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
163
click to vote
PPOPP
2009
ACM
16 years 4 months ago
2009
ACM
A stream processor executes an application that has been decomposed into a sequence of kernels that operate on streams of data elements. During the execution of a kernel, all stre...
197
Voted
ICALP
2011
Springer
14 years 7 months 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 ...
153
click to vote
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...