Minimum entropy coloring
- 100 Downloads
We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of a coloring is called the chromatic entropy and was shown by Alon and Orlitsky (IEEE Trans. Inform. Theory 42(5):1329–1339, 1996) to play a fundamental role in the problem of coding with side information. In this paper, we consider the minimum entropy coloring problem from a computational point of view. We first prove that this problem is NP-hard on interval graphs. We then show that, for every constant ε>0, it is NP-hard to find a coloring whose entropy is within (1−ε)log n of the chromatic entropy, where n is the number of vertices of the graph. A simple polynomial case is also identified. It is known that graph entropy is a lower bound for the chromatic entropy. We prove that this bound can be arbitrarily bad, even for chordal graphs. Finally, we consider the minimum number of colors required to achieve minimum entropy and prove a Brooks-type theorem.
KeywordsComplexity Entropy Graph coloring
Unable to display preview. Download preview PDF.
- Agarwal S, Belongie S (2002) On the non-optimality of four color coding of image partitions. In: Proc. IEEE int. conf. image processing Google Scholar
- Cardinal J, Fiorini S, Van Assche G (2004) On minimum entropy graph colorings. In: Proc. IEEE int. symposium on information theory, p 43 Google Scholar
- Diestel R (2000) Graph theory, 2nd edn. Graduate Texts in Mathematics, vol 173. Springer, New York Google Scholar
- Gabow HN (1990) Data structures for weighted matching and nearest common ancestors with linking. In: 1st annual ACM-SIAM symposium on discrete algorithms, pp 434–443 Google Scholar
- Halperin E, Karp RM (2004) The minimum-entropy set cover problem. In: Automata, languages and programming. Lecture notes in comput. sci., vol 3142. Springer, Berlin, pp 733–744 Google Scholar
- Körner J (1973) Coding of an information source having ambiguous alphabet and the entropy of graphs. In: Transactions of the sixth Prague conference on information theory, statistical decision functions, random processes (Tech Univ., Prague, 1971; dedicated to the memory of Antonín Špaček). Academia, Prague, pp 411–425 Google Scholar
- Pemmaraju SV, Raman R, Varadarajan K (2004) Buffer minimization using max-coloring. In: SODA ’04: Proceedings of the fifteenth annual ACM-SIAM symposium on discrete algorithms. Siam, Philadelphia, pp 562–571 Google Scholar
- Simonyi G (2001) Perfect graphs and graph entropy. An updated survey. In: Perfect graphs. Discrete math. optim. Wiley, Chichester, pp 293–328 Google Scholar
- Zhao Q, Effros M (2003) Low complexity code design for lossless and near-lossless side information source codes. In: Proc. IEEE data compression conf. Google Scholar