513 search results - page 2 / 103 » Soft Edge Coloring |
114
Voted
COLOGNETWENTE
2010
14 years 8 months ago
2010
An interval total t coloring of a graph G is a total coloring of with colors 1, such that at least one vertex or edge of is colored by color − G 2, ,t… G , 1, 2, ,i i t= … ,...
109
Voted
Publication
Given a single image of an arbitrary road, that may not be well-paved, or have clearly delineated edges, or some a priori known color or texture distribution, is it possible for a ...
100
Voted
JCT
2010
14 years 8 months ago
2010
We call a coloring of the edge set of a graph G a b-bounded coloring if no color is used more than b times. We say that a subset of the edges of G is rainbow if each edge is of a ...
ICIP
2003
IEEE
15 years 12 months ago
2003
IEEE
We compare the properties of intensity and color edges in photographs of real scenes and paintings. We demonstrate that paintings contain significantly more color-only edges, wher...
88
Voted
PERCOM
2006
ACM
15 years 9 months ago
2006
ACM
Abstract-- We give efficient sequential and distributed approximation algorithms for strong edge coloring graphs modeling wireless networks. Strong edge coloring is equivalent to c...