263 search results - page 16 / 53 » Minimum Entropy Coloring |
115
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
The oriented chromatic number of an oriented graph G is the minimum order of an oriented graph H such that G admits a homomorphism to H. The oriented chromatic number of an undire...
136
click to vote
COMBINATORICS
2002
14 years 11 months ago
2002
Erdos, Rubin, and Taylor found a nice correspondence between the minimum order of a complete bipartite graph that is not r-choosable and the minimum number of edges in an r-unifor...
117
click to vote
COCOON
2005
Springer
15 years 5 months ago
2005
Springer
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...
101
click to vote
SCALESPACE
2007
Springer
15 years 6 months ago
2007
Springer
This paper deals with video segmentation based on motion and spatial information. Classically, the nucleus of the motion term is the motion compensation error (MCE) between two con...
118
click to vote
OL
2010
14 years 6 months ago
2010
This article studies a degree-bounded generalization of independent sets called co-k-plexes. Constant factor approximation algorithms are developed for the maximum co-k-plex probl...