Content deleted Content added
Igorfratel (talk | contribs) Added reference to parallel algorithms for another variation of the shortest pair problem: the single-source shortest path problem |
Kaltenmeyer (talk | contribs) m →Runtime: clean up, typo(s) fixed: Therefore → Therefore, |
||
Line 149:
===Runtime===
The runtime of the sequential algorithm is determined by the triple nested for loop. The computation in line 6 can be done in constant time (<math>O(1)</math>). Therefore, the runtime of the sequential algorithm is <math>O(n^3)</math>.
====2-D block mapping====
| |||