Old Web
English
Sign In
Acemap
>
Paper
>
Cases where finding the minimum entropy coloring of a characteristic graph is a polynomial time problem
Cases where finding the minimum entropy coloring of a characteristic graph is a polynomial time problem
2010
Soheil Feizi-Khankandi
Muriel Médard
Keywords:
Minimum k-cut
List coloring
Fractional coloring
Combinatorics
Voltage graph
Discrete mathematics
Greedy coloring
Integral graph
Graph coloring
Mathematics
Complete coloring
Correction
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]