Its time complexity also remains unknown. In this paper, we perform run-time analysis and show that Generic Dijkstra running time grows quadratically with the number of graph vertices and logarithmically with the number of edge units. We also discover that the running time of the Generic ...
Table 1: Comparison of Dice, latency (LT, in ms) and throughput (TP, in FPS) of sub-networks formed by RT-DNAS with network level search carried out using the proposed GA algorithm (which considers real-time constraints) and the Dijkstra algorithm used in the original MS-NAS (which ...