130 search results - page 5 / 26 » Online Coloring Known Graphs |
103
click to vote
RSA
2011
14 years 4 months ago
2011
: The classical result in the theory of random graphs, proved by Erd˝os and Rényi in 1960, concerns the threshold for the appearance of the giant component in the random graph pr...
VR
2002
IEEE
15 years 2 months ago
2002
IEEE
We have developed a method for recognizing and tracking known three-dimensional objects in scene images captured from a user’s viewpoint. The method uses multiple color histogra...
IWPEC
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We explore the effects of using graph width metrics as restrictions on the input to online problems. It seems natural to suppose that, for graphs having some form of bou...
EJC
2007
14 years 9 months ago
2007
We introduce and study online balanced coloring games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with n vertices are ...
FSTTCS
2007
Springer
15 years 3 months ago
2007
Springer
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...