On the probabilistic minimum coloring and minimum \(k\)-coloring (Q2489951): Difference between revisions

Consider a partition of the vertex set of a graph \(G\) into independent sets. The weight of any independent set is the probability that at least one of its vertices is present in a certain random subgraph of \(G\). Probabilistic minimum coloring is to determine a partition that minimizes the sum of the weights of its sets. The problem is shown to be NP-hard, and an approximation polynomial time solution algorithm is given. Specific results on optimal \(k\)-coloring for \(k>2\) are given for bipartite graphs.