Sentence examples for minimum coloring problem from inspiring English sources

The minimum coloring problem is well known to be NP-hard for general graphs [8].

We study a robustness model for the minimum coloring problem, where any vertex vi of the input-graph G V,E) has some presence probability pi.

We solve the minimum coloring problem heuristically by repeatedly solving the MaIS sub-problem to determine the minimum number of channels required for interference-free CA in MRMC WMNs.

The problem of assigning channels to the links involved in routing so that communication among mesh nodes is interference free is similar to the minimum coloring problem for the conflict graph, which is known to be NP-hard for general graphs [8].

The minimum coloring problem is the problem of computing a coloring of the vertices in the conflict graph F using as few distinct colors as possible; this is the same as the problem of finding the minimum number of channels to use such that there is no interference.

The minimum sum coloring problem (MSCP) is to find a proper k-coloring while minimizing the sum of the colors assigned to the vertices.

The objective of the Weighted Coloring Problem [7] is, given a vertex-weighted graph (G), to determine the minimum weight of a proper coloring of (G), that is, its weighted chromatic number.

In the FA modeled as a the graph coloring problem, the task is to color all the nodes of the graph with the minimum number of colors, in a way that no two adjacent nodes (nodes connected with an edge) have the same color [4 6].

The Weighted Coloring Problem [7] consists in, for a given graph (G) with non-negatives real weights associated to its vertices, determining the minimum weight of a proper coloring of (G), that is, the weighted chromatic number of (G), denoted by (chi _w(G)): begin{aligned} chi _w(G) = min _{c mathrm{coloring,of} G} w(c).

We formulate the problem as a graph coloring problem.

This problem is a generalization of the graph coloring problem.