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 such networks include interplanetary, orbital (e.g., low Earth orbit) satellite, and sensor networks. 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 such networks include interplanetary, orbital (e.g., low earth orbit) satellite, and sensor networks
No takes yet. Share an insight, caveat, or question.
D.C. Lee (2006) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: