|
|
|
|
|
Dennis Nii Ayeh Mensah, Hui Gao and Liang Wei Yang
Proposed algorithms for calculating the shortest paths such as Dijikstra and Flowd-Warshall?s algorithms are limited to small networks due to computational complexity and cost. We propose an efficient and a more accurate approximation algorithm that is a...
ver más
|
|
|
|
|