Content deleted Content added
Added tags to the page using Page Curation (uncategorised) |
Added tags to the page using Page Curation (more footnotes) |
||
Line 1:
{{more footnotes|date=March 2018}}
A central problem in graph theorie is the [[shortest path problem]]. Hereby, the problem of finding the shortest path between every pair of nodes is known as ''All-Pair-Shortest-Paths (APSP)'' problem. As sequential algorithms for this problem often yield long runtimes, parallelization has shown to be beneficial in this field. In this article two efficient algorithms solving this problem are introduced.
== Problem definition==
| |||