570 search results - page 11 / 114 » On the complexity of distributed graph coloring |
AMC
2008
13 years 8 months ago
2008
This paper introduces a general framework for defining the entropy of a graph. Our definition is based on a local information graph and on information functionals derived from the...
PODC
2010
ACM
14 years 13 days ago
2010
ACM
Consider an n-vertex graph G = (V, E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neig...
EMMCVPR
2009
Springer
14 years 13 days ago
2009
Springer
Complex diffusion was introduced in the image processing literature as a means to achieve simultaneous denoising and enhancement of scalar valued images. In this paper, we present ...
CSJM
2006
13 years 8 months ago
2006
The popularity of distributed file systems continues to grow in last years. The reasons they are preferred over traditional centralized systems include fault tolerance, availabili...
LCPC
1994
Springer
14 years 19 days ago
1994
Springer
Data parallel programs are sensitive to the distribution of data across processor nodes. We formulate the reduction of inter-node communication as an optimization on a colored gra...