Login / Signup

The Complexity of Broadcasting in Planar and Decomposable Graphs.

Andreas JakobyRüdiger ReischukChristian Schindelhauer
Published in: WG (1994)
Keyphrases
  • computational complexity
  • neural network
  • worst case
  • np complete
  • decision problems
  • graph model
  • polynomial time complexity
  • computational cost
  • graph theory
  • graph structure
  • bounded treewidth
  • series parallel