Parallel single-source shortest path algorithm
id:
parallel-single-source-shortest-path-algorithm-252-15162873
title:
Parallel single-source shortest path algorithm
text:
A central problem in algorithmic graph theory is the shortest path problem. One of the generalizations of the shortest path problem is known as the single-source-shortest-paths (SSSP) problem, which consists of finding the shortest paths from a source vertex s to all other vertices in the graph. There are classical sequential algorithms which solve this problem, such as Dijkstra's algorithm. In this article, however, we present two parallel algorithms solving this problem. Another variation of t
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Parallel_single-source_shortest_path_algorithm
date created:
date modified:
2023-09-27T17:57:07Z
main entity:
{"identifier":"Q96398406","url":"https://www.wikidata.org/entity/Q96398406"}
image:
fields total:
13
integrity:
13