Results 61 to 70 of about 49,625 (158)

Calculating the Shortest Path Using Dijkstra’s Algorithm

open access: yesAraştırma Temelli Etkinlik Dergisi, 2018
The Dijkstra's algorithm is an algorithm that determines the shortest paths needed to go from a starting node to any node in a graph. In this article, the process and results of an activity that included route formation among the provinces in the Aegean ...
Bekir Cevizci
doaj   +4 more sources

Prioritized Shortest Path Computation Mechanism (PSPCM) for wireless sensor networks. [PDF]

open access: yesPLoS One, 2022
Onwuegbuzie IU   +4 more
europepmc   +1 more source

Decreasing Shortest Path Length of the Sensorimotor Network Induces Frontal Glioma-Related Epilepsy. [PDF]

open access: yesFront Oncol, 2022
Fang S   +8 more
europepmc   +1 more source

Finding the k Shortest Paths

open access: yesSIAM Journal on Computing, 1998
Summary: We give algorithms for finding the \(k\) shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with \(n\) vertices and \(m\) edges, in time \(O(m+n\log n+k)\). We can also find the \(k\) shortest paths from a given source \(s\) to each
openaire   +2 more sources

Knapsack: Connectedness, Path, and Shortest-Path

open access: yes
Accepted in LATIN ...
Dey, Palash   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy