2310 search results - page 98 / 462 » Coloring Random Graphs |
142
click to vote
COLOGNETWENTE
2010
15 years 23 days ago
2010
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...
103
click to vote
JGT
2008
15 years 2 months ago
2008
The measurable list chromatic number of a graph G is the smallest number such that if each vertex v of G is assigned a set L(v) of measure in a fixed atomless measure space, the...
123
click to vote
DAM
2007
15 years 2 months ago
2007
In this paper, a structural theorem about toroidal graphs is given that strengthens a result of Borodin on plane graphs. As a consequence, it is proved that every toroidal graph w...
108
click to vote
PRL
2006
15 years 2 months ago
2006
Objects retain their color in spite of changes in the wavelength and energy composition of the light they reflect. This phenomenon is called color constancy and plays an important ...
109
Voted
STACS
2009
Springer
15 years 9 months ago
2009
Springer
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted ...