This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Unionfind This is the equivalent to finding the equivalence clases in a set. Parallel Component Labeling Algorithm Analysis Parallelizing Baruvka's Algorithm Assume CRCW (minimum number written) Assume E + V processors Algorithm Initialization Find minimum edge adjacent to each node and mark them. Iterate Perform parallel component labeling. Find minimum edge connecting each node to another component. Find overall minimum edge connecting each component to another. Add all these edges into the graph...
View
Full Document
 Fall '08
 Linderoth
 Operations Research, Graph Theory, component labeling, Parallelizing Baruvka, parallel component labeling

Click to edit the document details