460 search results - page 3 / 92 » New Tools for Graph Coloring |
SIROCCO
2007
13 years 6 months ago
2007
We present the first location oblivious distributed unit disk graph coloring algorithm having a provable performance ratio of three (i.e. the number of colors used by the algorit...
FOCS
2002
IEEE
13 years 10 months ago
2002
IEEE
We prove that coloring a 3-uniform 2-colorable hypergraph with c colors is NP-hard for any constant c. The best known algorithm [20] colors such a graph using O(n1/5 ) colors. Our...
FPL
2001
Springer
13 years 9 months ago
2001
Springer
In this paper we present a new method of integrating the placement and routing stages in the physical design of channel-based architectures, and present the first implementation o...
ECCV
2008
Springer
14 years 7 months ago
2008
Springer
We aim to color greyscale images automatically, without any manual intervention. The color proposition could then be interactively corrected by user-provided color landmarks if nec...
ENDM
2000
13 years 5 months ago
2000
Attempts to solve the famous Four Color Problem led to fruitful discoveries and rich coloring theories. In this talk, some old and some recent applications of tools from topology ...