Login / Signup

Acyclic choosability of planar graphs: a Steinberg like approach.

Hervé HocquardMickaël Montassier
Published in: Electron. Notes Discret. Math. (2009)
Keyphrases
  • planar graphs
  • np hard
  • np complete
  • approximate inference
  • minimum weight
  • xml documents
  • maximum likelihood
  • belief propagation