720 search results - page 66 / 144 » Nonrepetitive colorings of graphs |
BMVC
2010
13 years 2 months ago
2010
Saliency detection is a well researched problem in computer vision. In previous work, most of the effort is spent on manually devising a saliency measure. Instead we propose a sim...
JGAA
2006
13 years 7 months ago
2006
We consider two problems, namely Min Split-coloring and Min Cocoloring, that generalize the classical Min Coloring problem by using not only stable sets but also cliques to cover ...
ICTCS
2005
Springer
14 years 1 months ago
2005
Springer
Given a vertex-weighted graph G = (V, E; w), w(v) ≥ 0 for any v ∈ V , we consider a weighted version of the coloring problem which consists in finding a partition S = (S1, . ...
SPAA
2000
ACM
14 years 1 days ago
2000
ACM
We conduct an experimental analysis of a distributed, randomized algorithm for edge coloring graphs. The algorithm is extremely simple, yet, according to the probabilistic analysi...
AAAI
1997
13 years 9 months ago
1997
Constraint satisfaction research has focussed on consistency checking using k-consistency and its variations such as arc-consistency, and path-consistency. We define a new form of...