1749 search results - page 85 / 350 » Conditional colorings of graphs |
155
click to vote
ICTCS
2005
Springer
15 years 12 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, . ...
143
click to vote
SPAA
2000
ACM
15 years 10 months 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...
157
click to vote
AAAI
1997
15 years 7 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...
148
click to vote
ICPR
2010
IEEE
15 years 7 months ago
2010
IEEE
The median and mean graph are basic building blocks for statistical graph analysis and unsupervised pattern recognition methods such as central clustering and graph quantization. ...
194
click to vote
IVC
2007
15 years 6 months ago
2007
In this paper, we propose a new technique to perform figure-ground segmentation in image sequences of moving objects under varying illumination conditions. Unlike most of the alg...