On the total choosability of planar graphs and of sparse graphs.

Gerard Jennhwa Chang Jianfeng Hou Nicolas Roussel

Published in: Inf. Process. Lett. (2010)

Keyphrases

planar graphs
max cut
minimum weight
approximate inference
high dimensional
belief propagation
undirected graph
dynamic programming
data points