5,323
edits
Parallel Algorithms: Difference between revisions
→A second connectivity algorithm
| Line 535: | Line 535: | ||
# Hooking non-hooked-upon: every rooted star not hooked upon in step 2 hooks to another vertex in another supervertex which is not a leaf | # Hooking non-hooked-upon: every rooted star not hooked upon in step 2 hooks to another vertex in another supervertex which is not a leaf | ||
# Parallel pointer jumping: one round of parallel pointer jumping | # Parallel pointer jumping: one round of parallel pointer jumping | ||
;Theorems | |||
;Complexity | |||
===Minimum Spanning Forest=== | ===Minimum Spanning Forest=== | ||