Login / Signup

Distributed graph coloring in wireless ad hoc networks: A light-weight algorithm based on Japanese tree frogs' calling behaviour.

Hugo HernándezChristian Blum
Published in: WMNC (2011)
Keyphrases
  • lightweight
  • graph coloring
  • learning algorithm
  • tree structure
  • cost function
  • distributed breakout
  • optimal solution
  • computational complexity
  • dynamic programming
  • np hard
  • integer programming