570 search results - page 9 / 114 » On the complexity of distributed graph coloring |
PERCOM
2008
ACM
14 years 2 months 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...
DCC
2007
IEEE
14 years 8 months ago
2007
IEEE
We consider the distributed computation of a function of random sources with minimal communication. Specifically, given two discrete memoryless sources, X and Y , a receiver wishe...
ICALP
2007
Springer
14 years 13 days ago
2007
Springer
Abstract. We study the problem of the amount of information (advice) about a graph that must be given to its nodes in order to achieve fast distributed computations. The required s...
ESA
2004
Springer
14 years 1 months ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
DAM
2006
13 years 8 months ago
2006
Given a rectangular array where entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each colo...