513 search results - page 3 / 103 » Soft Edge Coloring |
95
Voted
ISCAS
2005
IEEE
15 years 6 months ago
2005
IEEE
—Demosaicing is a color interpolation process that converts a raw image generated by a color filter array to a full color image by estimating the missing color components of each...
113
click to vote
ALGORITHMICA
2008
15 years 15 days ago
2008
We show efficient algorithms for edge-coloring planar graphs. Our main result is a linear-time algorithm for coloring planar graphs with maximum degree with max{, 9} colors. Thus...
90
Voted
CC
2006
Springer
15 years 13 days ago
2006
Springer
The sum of a coloring is the sum of the colors assigned to the vertices (assuming that the colors are positive integers). The sum (G) of graph G is the smallest sum that can be ach...
104
Voted
FSTTCS
2000
Springer
15 years 4 months ago
2000
Springer
We investigate a variant of on-line edge-coloring in which there is a fixed number of colors availableandtheaimistocolorasmanyedgesaspossible.Weproveupperandlowerboundsontheperform...
107
Voted
DAM
2002
15 years 2 days ago
2002
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...