Login / Signup

The computational complexity of the backbone coloring problem for planar graphs with connected backbones.

Robert JanczewskiKrzysztof Turowski
Published in: Discret. Appl. Math. (2015)
Keyphrases
  • planar graphs
  • computational complexity
  • undirected graph
  • np complete
  • connected components
  • minimum weight
  • special case
  • approximate inference
  • minimum spanning tree
  • belief propagation
  • weighted graph