Cases where finding the minimum entropy coloring of a characteristic graph is a polynomial time problem

In this paper, we consider the problem of finding the minimum entropy coloring of a characteristic graph under some conditions which allow it to be in polynomial time. This problem arises in the functional compression problem where the computation of a function of sources is desired at the receiver....

Full description

Bibliographic Details
Main Authors: Feizi-Khankandi, Soheil (Contributor), Medard, Muriel (Contributor)
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Massachusetts Institute of Technology. Research Laboratory of Electronics (Contributor)
Format: Article
Language:English
Published: Institute of Electrical and Electronics Engineers (IEEE), 2012-10-16T14:55:37Z.
Subjects:
Online Access:Get fulltext

Similar Items