On the probabilistic minimum coloring and minimum \(k\)-coloring (Q2489951): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 07:19, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the probabilistic minimum coloring and minimum \(k\)-coloring |
scientific article |
Statements
On the probabilistic minimum coloring and minimum \(k\)-coloring (English)
0 references
28 April 2006
0 references
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.
0 references
vertex coloring
0 references
random subgraph coloring
0 references
probabilistic minimization algorithms
0 references
