215 search results - page 10 / 43 » Online Bin Coloring |
FSTTCS
2000
Springer
15 years 3 months ago
2000
Springer
We investigate a variant of on-line edge-coloring in which there is a fixed number of colors availableandtheaimistocolorasmanyedgesaspossible.Weproveupperandlowerboundsontheperform...
168
click to vote
Publication
In this letter, we proposed a new recoloring method for people with protanopic and deuteranopic color deficiencies.We present a color transformation that aims to preserve the color...
COMBINATORICS
2000
14 years 11 months ago
2000
In this paper we consider the problem of establishing a value r0 such that almost all random graphs with n vertices and rn edges, r > r0, are asymptotically not 3-colorable. In...
209
click to vote
ICASSP
2009
IEEE
16 years 5 months ago
2009
IEEE
In this paper, we propose a new re-coloring algorithm to enhance the accessibility for the color vision deficient (or colorblind). Compared to people with normal color vision, peop...
88
Voted
SIAMDM
2008
14 years 11 months ago
2008
We first show that for any bipartite graph H with at most five vertices, there exists an on-line competitive algorithm for the class of H-free bipartite graphs. We then analyze th...