Abstract: This paper presents and proves the correctness of a modified Dijkstra's algorithm that computes the shortest-delay path in networks with deterministically time-varying links. Examples of ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results