Content deleted Content added
fix an unjustified and highly unbelievable claim by replacing "graph theory" (a wide area of mathematics or combinatorics) with "algorithmic graph theory" |
|||
Line 4:
}}
A central problem in algorithmic [[graph theory]] 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 algorithm]]s 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==
| |||