Login / Signup
On choosability with separation of planar graphs with lists of different sizes.
Hal A. Kierstead
Bernard Lidický
Published in:
CoRR (2013)
Keyphrases
</>
planar graphs
weighted graph
approximate inference
higher order
belief propagation
greedy algorithm
message passing
bipartite graph
minimum weight