The exchange of information requires the shortest path route to optimize data transmission process. The complexity of the shortest path algorithm becomes important because of the device processing ...

This paper continues the idea of a gearbox-like routing algorithm selection in runtime presented at IEEE LANMAN 2011. Following the results obtained by simulations, the objectives were this time to ...

To find the Single Source Shortest Path (SSSP) and All Pairs Shortest Path (APSP) on graphs with multi-dimensional edge weights, shortest path algorithms like Bellman-Ford and Floyd-Warshall can be ...