On the Computational Complexity of Routing in Faulty k-ary n-Cubes and Hypercubes.
Iain A. StewartPublished in: Parallel Process. Lett. (2012)
Keyphrases
- computational complexity
- routing problem
- high computational complexity
- special case
- np complete
- routing protocol
- np hard
- routing algorithm
- low complexity
- network topology
- ad hoc networks
- decision problems
- mobile ad hoc networks
- storage requirements
- ant algorithm
- bit rate
- multicast routing
- inter domain
- computational efficiency
- routing decisions
- learning algorithm
- linear computational complexity
- memory requirements
- wireless ad hoc networks
- model based diagnosis
- database
- data cube
- shortest path
- computational cost
- databases