Login / Signup

An Algorithm for Generating Node Disjoint Routes in Kautz Digraphs.

Gerard J. M. SmitPaul J. M. HavingaPierre G. Jansen
Published in: IPPS (1991)
Keyphrases
  • computational complexity
  • optimal solution
  • dynamic programming
  • simulated annealing
  • particle swarm optimization
  • search space
  • energy consumption