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. The rate region of the functional compression problem has been considered in some references under some assumptions. Recently, Feizi et al. computed this rate region for a general one-stage tree network and its extension to a general tree network. In their proposed coding scheme, one needs to compute the minimum entropy coloring (a coloring random variable which minimizes the entropy) of a characteristic graph. In general, finding this coloring is an NP-hard problem (as shown by Cardinal et al.). However, in this paper, we show that depending on the characteristic graph's structure, there are some interesting cases where finding the minimum entropy coloring is not NP-hard, but tractable and practical. In one of these cases, we show that, having a non-zero joint probability condition on RVs' distributions, for any desired function f, makes characteristic graphs to be formed of some non-overlapping fully-connected maximal independent sets. Therefore, the minimum entropy coloring can be solved in polynomial time. In another case, we show that if f is a quantization function, this problem is also tractable.
['Soheil Feizi', 'Muriel Medard']
Cases where finding the minimum entropy coloring of a characteristic graph is a polynomial time problem