On the computational complexity and effectiveness of N-hub shortest-path routing.

Reuven Cohen Gabi Nakibly

Published in: IEEE/ACM Trans. Netw. (2008)

Keyphrases

computational complexity
special case
np complete
low complexity
neural network
mobile robot
computational cost
computational efficiency