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

Soheil Feizi, Muriel Mdard

Browse the full ISIT paper archive.