{"version":"1.0","type":"link","title":"Parallel all-pairs shortest path algorithm - Newikis","description":"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 algorithms for this problem often yield long runtimes, parallelization has shown…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}