570 search results - page 4 / 114 » Edge Coloring with Delays |
ESA
2008
Springer
14 years 11 months ago
2008
Springer
We consider two generalizations of the edge coloring problem in bipartite graphs. The first problem we consider is the weighted bipartite edge coloring problem where we are given a...
CVPR
1999
IEEE
15 years 11 months ago
1999
IEEE
108
click to vote
ECCV
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. For grey-value images, it is well accepted that the neighborhood rather than the pixel carries the geometrical interpretation. Interestingly the spatial configuration of ...
105
click to vote
COCOON
2005
Springer
15 years 3 months ago
2005
Springer
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...
100
click to vote
DSD
2003
IEEE
15 years 2 months ago
2003
IEEE
Heuristic algorithms for coloring the edges of large undirected single-edge graphs with (or very close to) the minimal number of colors are presented. Compared to simulated anneal...