460 search results - page 5 / 92 » New Tools for Graph Coloring |
ESA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We provide new tools, such as k-troikas and good subtreerepresentations, that allow us to give fast and simple algorithms computing branchwidth. We show that a graph G ha...
JGT
2007
13 years 7 months ago
2007
It is known that for every integer k ≥ 4, each k-map graph with n vertices has at most kn − 2k edges. Previously, it was open whether this bound is tight or not. We show that ...
MTA
2006
13 years 7 months ago
2006
Indexing and segmenting of video content by motion, color and texture has been intensively explored leading to a usual representation in a storyboard. In this paper, a novel metho...
COCOA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
ICIP
2005
IEEE
14 years 9 months ago
2005
IEEE
Color palettes are an important tool for color image analysis, since they are the initial point of different techniques such as quantization or indexing. This paper presents a new...