Login / Signup

Three completely independent spanning trees of crossed cubes with application to secure-protection routing.

Kung-Jui PaiRuay-Shiung ChangRo-Yu WuJou-Ming Chang
Published in: Inf. Sci. (2020)
Keyphrases
  • spanning tree
  • completely independent
  • ad hoc networks
  • minimum spanning tree
  • previously mentioned
  • reinforcement learning
  • computational complexity
  • probabilistic model
  • shortest path
  • security level