PDPTA
2003
14 years 1 months ago
2003
In this paper, we study the coloring problem for the undirected binary de Bruijn interconnection network. The coloring scheme is simple and fast. We propose the coloring algorithm...
ESA
2006
Springer
14 years 4 months ago
2006
Springer
We consider the following vertex coloring problem. We are given an undirected graph G = (V, E), where each vertex v is associated with a penalty rejection cost rv. We need to choos...
ICTCS
2005
Springer
14 years 6 months ago
2005
Springer
Given a vertex-weighted graph G = (V, E; w), w(v) ≥ 0 for any v ∈ V , we consider a weighted version of the coloring problem which consists in finding a partition S = (S1, . ...
STACS
2007
Springer
14 years 6 months ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
COCOA
2007
Springer
14 years 6 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...
CPM
2009
Springer
14 years 7 months ago
2009
Springer
The NP-hard Interval Constrained Coloring problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer interv...