Topics
graphBook
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,..., Sk) of the vertex set V of G into stable sets and minimizing∑k i=1 w(Si) where the weight of S is defined as max{w(v) : v ∈ S}. In this paper, we keep on with the investigation of the complexity and the approximability of this problem by mainly answering one of the questions raised by D. J. Guan and X. Zh
We consider a weighted version of the well-known Vertex Coloring Problem (VCP) in which each vertex ...
AbstractThe max-edge-coloring problem is a natural weighted generalization of the classical edge-col...
Weighted coloring is a generalization of the well-known vertex (unweighted) coloring for which a num...
Given a vertex-weighted graph G = (V,E;w), w(v) ≥ 0 for any v ∈ V, we consider a weighted version of...
approximability results Bruno Escoffier∗, Jérôme Monnot∗, Vangelis Th. Paschos∗ Given a vertex-weigh...
A version of weighted coloring of a graph is introduced: each node υ of a graph G = (V,E) is provide...
We study the following generalization of the classical edge coloring problem: Given a weighted graph...
We study the following generalization of the classical edge coloring problem: Given a weighted graph...
Given a graph G = (V,E) and a weight function w: E → R, a coloring of vertices of G, induced by w, i...
[[abstract]]A proper vertex coloring of a graph G is a partition \{A_1,A_2,\ldots ,A_k\} of the ve...
International audienceA proper coloring of a graph is a partition of its vertex set into stable sets...
In a bounded max-coloring of a vertex/edge weighted graph, each color class is of cardinality at mos...
In Vertex Coloring Problems, one is required to assign a color to each vertex of an undirected graph...
We study the weighted generalization of the edge coloring problem where the goal is to minimize the ...
International audienceGiven a graph G, a proper k-coloring of G is a partition c = (S i) i∈[1,k] of ...
We consider a weighted version of the well-known Vertex Coloring Problem (VCP) in which each vertex ...
AbstractThe max-edge-coloring problem is a natural weighted generalization of the classical edge-col...
Weighted coloring is a generalization of the well-known vertex (unweighted) coloring for which a num...
Given a vertex-weighted graph G = (V,E;w), w(v) ≥ 0 for any v ∈ V, we consider a weighted version of...
approximability results Bruno Escoffier∗, Jérôme Monnot∗, Vangelis Th. Paschos∗ Given a vertex-weigh...
A version of weighted coloring of a graph is introduced: each node υ of a graph G = (V,E) is provide...
We study the following generalization of the classical edge coloring problem: Given a weighted graph...
We study the following generalization of the classical edge coloring problem: Given a weighted graph...
Given a graph G = (V,E) and a weight function w: E → R, a coloring of vertices of G, induced by w, i...
[[abstract]]A proper vertex coloring of a graph G is a partition \{A_1,A_2,\ldots ,A_k\} of the ve...
International audienceA proper coloring of a graph is a partition of its vertex set into stable sets...
In a bounded max-coloring of a vertex/edge weighted graph, each color class is of cardinality at mos...
In Vertex Coloring Problems, one is required to assign a color to each vertex of an undirected graph...
We study the weighted generalization of the edge coloring problem where the goal is to minimize the ...
International audienceGiven a graph G, a proper k-coloring of G is a partition c = (S i) i∈[1,k] of ...
We consider a weighted version of the well-known Vertex Coloring Problem (VCP) in which each vertex ...
AbstractThe max-edge-coloring problem is a natural weighted generalization of the classical edge-col...
Weighted coloring is a generalization of the well-known vertex (unweighted) coloring for which a num...
Add to ORKG