### Table 3: Parallel Shortest Path Algorithm

1997

"... In PAGE 4: ... Our parallel shortest path algorithm uses the SPMD model for which each processor solves the portion of the shortest path tree on its subnetwork for each source. The outline of the algorithm is given in Table3 . Each processor repeatedly solves for shortest paths for its assigned subnetwork.... ..."

Cited by 7

### Table 3: Parallel Shortest Path Algorithm

1997

"... In PAGE 4: ... Our parallel shortest path algorithm uses the SPMD model for which each processor solves the portion of the shortest path tree on its subnetwork for each source. The outline of the algorithm is given in Table3 . Each processor repeatedly solves for shortest paths for its assigned subnetwork.... ..."

Cited by 7

### Table 1. Trace of BST Shortest Path Algorithm Iteration Set of Paths

### Table 3 Shortest-path running times

"... In PAGE 7: ...1. Shortest-path algorithms We have collected the running times, from [12] in Table3 (the largest problem instances only). 13 Table 4 contains the ranking of the algorithms based on their running times.... ..."

### Table 3 Shortest-path running times

"... In PAGE 7: ...1. Shortest-path algorithms We have collected the running times, from [12] in Table3 (the largest problem instances only). Table 4 contains the ranking of the algorithms based on their running times.... ..."

### Table 3 Performance of Shortest Path Search

"... In PAGE 2: ... This allows us to test if a general link classification model could be obtained to apply to unseen Websites. We build different versions of weighted directed graphs using each of the three types of classifiers and compare the performances of the algorithms on the different graphs Table3 and 4. As can be seen from the results, the SPS and DMST algorithms using weighted graph models outperform the simple BFS significantly.... ..."

Cited by 1

### Table 3: Comparison of power consumed using EAOR and Shortest path Algorithm.

"... In PAGE 4: ...66 For the same scenario, when shortest path algorithm was used, the power consumed and the number of hops in each of the 8 available paths were found out and are tabulated in Table 2. Table3... ..."

### TABLE II TOTAL BANDWIDTH ROUTED BY THE SHORTEST PATH ALGORITHM VS. PBR.

2001

Cited by 37

### TABLE II TOTAL BANDWIDTH ROUTED BY THE SHORTEST PATH ALGORITHM VS. PBR.

2001

Cited by 37