Content deleted Content added
No edit summary |
split bibliography from reflist |
||
Line 1:
{{
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.
Line 177:
== References ==
{{reflist}}
==Bibliography==
* Grama, A.: ''Introduction to parallel computing.'' Pearson Education, 2003.
* Kumar, V.: ''Scalability of Parallel Algorithms for the All-Pairs Shortest-Path Problem.'' Journal of Parallel and Distributed Programming 13, 1991.
| |||