2310 search results - page 26 / 462 » Coloring Random Graphs |
ICIP
2009
IEEE
14 years 8 months ago
2009
IEEE
We propose in this work a new random pattern with R,G,B colors, which can be used to design color filter arrays (CFA) with good spectral properties, since the chrominance is modul...
FUN
2010
Springer
14 years 15 days ago
2010
Springer
The Honey-Bee game is a two-player board game that is played on a connected hexagonal colored grid, or in a generalized setting, on a connected graph with colored nodes. In a singl...
PERCOM
2006
ACM
14 years 7 months ago
2006
ACM
Abstract-- We give efficient sequential and distributed approximation algorithms for strong edge coloring graphs modeling wireless networks. Strong edge coloring is equivalent to c...
COMPGEOM
2008
ACM
13 years 9 months ago
2008
ACM
We show that the vertices of any plane graph in which every face is of length at least g can be colored by (3g - 5)/4 colors so that every color appears in every face. This is nea...
DAM
2010
13 years 7 months ago
2010
A dynamic coloring of a graph is a proper coloring of its vertices such that every vertex of degree more than one has at least two neighbors with distinct colors. The least number...