IEEE/ICACT20210213 Slide.16        [Big Slide]       [YouTube] Oral Presentation
We evaluate our MC suite of algorithms, compared to the traditional shortest path algorithms, considering minimum distance or minimum hops in Dynamic Shortest Path with minimum distance(we abbreviate it by DSP-md), dynamic shortest path with minimum hops(the DSP-mh). Also, we evaluate our algorithm to the least congested paths the Dynamic shortest path inverted weight DSP-inv which is the maximum distance.

[Go to Next Slide]
Select Voice: