Revision as of 18:17, 6 May 2022 edit 83.135.58.218 (talk) →Dijkstra algorithm ← Previous edit		Revision as of 05:23, 18 July 2022 edit undo GreenC bot (talk \| contribs) Bots 3,051,500 edits Rescued 1 archive link. Wayback Medic 2.5 Next edit →
Line 176: ==Bibliography== * Grama, A.: ''Introduction to parallel computing.'' Pearson Education, 2003. * Kumar, V.: ''[http://www.academia.edu/download/46545236/Scalability_of_parallel_algorithms_for_t20160616-15656-rc5uyt.pdf Scalability of Parallel Algorithms for the All-Pairs Shortest-Path Problem]{{dead link\|date=July 2022\|bot=medic}}{{cbignore\|bot=medic}}.'' Journal of Parallel and Distributed Programming 13, 1991. * Foster, I.: ''Designing and Building Parallel Programs'' (Online). * Bindell, Fall: ''[http://www.cs.cornell.edu/~bindel/class/cs5220-f11/code/path.pdf Parallel All-Pairs Shortest Paths]'' Applications of Parallel Computers, 2011.

Parallel all-pairs shortest path algorithm: Difference between revisions