836 search results - page 38 / 168 » Orthogonal Colorings of Graphs |
161
Voted
CVPR
2009
IEEE
16 years 6 months ago
2009
IEEE
Color is a powerful visual cue for many computer vision
applications such as image segmentation and object recognition.
However, most of the existing color models depend on the i...
125
click to vote
COCOON
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We introduce a generic algorithmic technique and apply it on decision and counting versions of graph coloring. Our approach is based on the following idea: either a graph...
111
click to vote
MTA
2006
15 years 1 months ago
2006
Indexing and segmenting of video content by motion, color and texture has been intensively explored leading to a usual representation in a storyboard. In this paper, a novel metho...
105
click to vote
WG
2004
Springer
15 years 7 months ago
2004
Springer
We show how to use split decomposition to compute the weighted clique number and the chromatic number of a graph and we apply these results to some classes of graphs. In particular...
150
Voted
ALGORITHMICA
2010
15 years 5 days ago
2010
The problem of computing the chromatic number of a P5-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show tha...