Minimum entropy coloring

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3827 LNCS, Issue , 2005, Pages 819-828

  Cardinal, Jean ^a   Fiorini, Samuel ^a   Joret, Gwenaël ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COLORING; COMPUTATION THEORY; ENTROPY; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

BROOKS-TYPE THEOREMS; CHORDAL GRAPHS; CHROMATIC ENTROPY; GRAPH ENTROPY;

GRAPH THEORY;

EID: 33744952997     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11602613_82     Document Type: Conference Paper

References (21)

1. M. Accame, F.G.B. De Natale, and F. Granelli. Efficient labeling procedures for image partition encoding. Signal Processing, 80(6):1127-1131, June 2000.
2. S. Agarwal and S. Belongie. On the non-optimality of four color coding of image partitions. In Proc. IEEE Int. Conf. Image Processing, 2002.
3. N. Alon and A. Orlitsky. Source coding and graph entropies. IEEE Trans. Inform. Theory, 42(5):1329-1339, September 1996.
4. M. Bellare, O. Goldreich, and M. Sudan. Free bits, PCPs and non-approximability - towards tight results. In 36th Annual Symposium on Foundations of Computer Science (Milwaukee, WI, 1995), pages 422-431. IEEE Comput. Soc. Press, Los Alamitos, CA, 1995.
5. R. L. Brooks. On colouring the nodes of a network. Proc. Cambridge Philos, Soc., 37:194-197, 1941.
6. J. Cardinal, S. Fiorini, and G. Van Assche. On minimum entropy graph colorings. In Proc. IEEE Int. Symposium on Information Theory, page 43, 2004.
7. D. de Werra, F. Glover, and E. A. Silver. A chromatic scheduling model with costs. IIE Trans., 27:181-189, 1995.
8. D. de Werra, A. Hertz, D. Kobler, and N. V. R. Mahadev. Feasible edge colorings of trees with cardinality constraints. Discrete Math., 222(1-3):61-72, 2000.
9. U. Feige and J. Kilian. Zero knowledge and the chromatic number. J. Comput. Syst. Sci., 57(2):187-199, 1998.
10. M. R. Garey, D. S. Johnson, G. L. Miller, and C. H. Papadimitriou. The complexity of coloring circular arcs and chords. SIAM J. Algebraic Discrete Methods, 1(2):216-227, 1980.
11. M. C. Golumbic. Algorithmic graph theory and perfect graphs. Academic Press, 2004.
12. M. Grötschel, L. Lovász, and A. Schrijver. Geometric algorithms and combinatorial optimization, volume 2 of Algorithms and Combinatorics. Springer-Verlag, Berlin, second edition, 1993.
13. E. Halperin and R. M. Karp. The minimum-entropy set cover problem. In Automata, languages and programming, volume 3142 of Lecture Notes in Comput. Sci., pages 733-744. Springer, Berlin, 2004.
14. K. Jansen. Approximation results for the optimum cost chromatic partition problem. Journal of Algorithms, 34:54-89, 2000.
15. T.R. Jensen and B. Toft. Graph Coloring Problems. Wiley Interscience, 1995.
16. J. Kahn and J.H. Kim. Entropy and sorting. J. Comput. Syst. Sci., 51 (3):390-399, 1995.
17. D. Marx. A short proof of the NP-completeness of minimum sum interval coloring. Oper. Res. Lett., 33(4):382-384, 2005.
18. G. Simonyi. Perfect graphs and graph entropy. An updated survey. In Perfect graphs, Wiley-Intersci. Ser. Discrete Math. Optim., pages 293-328. Wiley, Chichester, 2001.
19. A. Tucker. An efficient test for circular-arc graphs. SIAM J. Comput., 9(1):1-24, 1980.
20. H. S. Witsenhausen. The zero-error side information problem and chromatic numbers. IEEE Trans. Inform. Theory, 22(5):592-593, 1976.
21. Q. Zhao and M. Effros. Low complexity code design for lossless and near-lossless side information source codes. In Proc. IEEE Data Compression Conf., 2003.