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....
| मुख्य लेखकों: | , |
|---|---|
| अन्य लेखक: | |
| स्वरूप: | लेख |
| भाषा: | en_US |
| प्रकाशित: |
Institute of Electrical and Electronics Engineers (IEEE)
2012
|
| ऑनलाइन पहुंच: | http://hdl.handle.net/1721.1/74017 https://orcid.org/0000-0002-0964-0616 https://orcid.org/0000-0003-4059-407X |