52 search results - page 3 / 11 » On the computational complexity of strong edge coloring |
ICIP
2002
IEEE
14 years 6 months ago
2002
IEEE
Color is one of the main visual cues and has been frequently used in image processing, analysis and retrieval. The extraction of highlevel color descriptors is an increasingly imp...
ICPR
2010
IEEE
13 years 10 months ago
2010
IEEE
—Captions in videos play a significant role for automatically understanding and indexing video content, since much semantic information is associated with them. This paper presen...
MFCS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
ICCS
2004
Springer
13 years 10 months ago
2004
Springer
In the present paper routing and wavelength assignment (RWA) in optical WDM networks is discussed. Previous techniques on based on the integer linear programming and graph coloring...
COMGEO
2004
ACM
13 years 4 months ago
2004
ACM
Let n point sites be situated on the vertices or edges of a geometric graph G over e edges. Each site can be assigned a multiplicative weight and a color. We discuss the complexit...