513 search results - page 2 / 103 » Soft Edge Coloring |
164
Voted
COLOGNETWENTE
2010
15 years 2 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= … ,...
160
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 ...
146
Voted
JCT
2010
15 years 2 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 ...
100
Voted
ICIP
2003
IEEE
16 years 5 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...
132
Voted
PERCOM
2006
ACM
16 years 3 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...