5052 search results - page 15 / 1011 » On the Complexity of Ordered Colorings |
COCOON
1999
Springer
14 years 22 days ago
1999
Springer
TCS
2008
13 years 8 months ago
2008
ICPR
2000
IEEE
14 years 9 months ago
2000
IEEE
Color features are among the most important features used in image database retrieval, especially in cases where no additional semantic information is available. Due to its compac...
MFCS
2005
Springer
14 years 1 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...
DM
1998
13 years 8 months ago
1998
The total chromatic number zt(G) of a graph G is the least number of colors needed to color the vertices and edges of G so that no adjacent vertices or edges receive the same colo...