570 search results - page 33 / 114 » Edge Coloring with Delays |
151
click to vote
JGT
2006
15 years 6 months ago
2006
We prove that for every fixed k and 5 and for sufficiently large n, every edge coloring of the hypercube Qn with k colors contains a monochromatic cycle of length 2 . This answer...
178
click to vote
SPAA
2003
ACM
15 years 11 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
148
click to vote
PERCOM
2008
ACM
16 years 13 days ago
2008
ACM
In this paper we present a protocol for sensor applications that require periodic collection of raw data reports from the entire network in a timely manner. We formulate the probl...
147
click to vote
WAOA
2005
Springer
15 years 11 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...
160
click to vote
SPAA
2009
ACM
16 years 26 days ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...