263 search results - page 26 / 53 » Minimum Entropy Coloring |
121
click to vote
IPL
2008
14 years 11 months ago
2008
A homomorphism from an oriented graph G to an oriented graph H is an arc-preserving mapping f from V(G) to V(H), that is f(x)f(y) is an arc in H whenever xy is an arc in G. The or...
TCS
2008
14 years 11 months ago
2008
Given a graph G and an integer k, two players alternatively color the edges of G using k colors so that adjacent edges get different colors. The game chromatic index g(G) is the m...
118
click to vote
RSA
2008
14 years 11 months ago
2008
: Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using k colors so that neighboring vertices get different colors. The first player ...
146
click to vote
ICALP
2011
Springer
14 years 3 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
ICIP
1999
IEEE
16 years 1 months ago
1999
IEEE
As wavelet-based image coding is set to become more widely used (e.g. with the completion of the JPEG2000 standard), memory efficiency for wavelet-based coding is becoming an incr...