{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Lecture15

Lecture15 - Union-find This is the equivalent to finding...

This preview shows pages 1–6. Sign up to view the full content.

IE 495 Lecture 15 October 19, 2000

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Reading for This Lecture Primary Horowitz and Sahni, Chapter 4 Kozen, Lecture 3 Secondary Miller and Boxer, Chapter 12 (up to page 286)
Baruvka's Algorithm At each step, select all edges that connect some component of the graph to it's nearest neighbor. Add all these edges to the tree simultaneously. Why does this work? Sequential Implementation

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Component Labeling Given a graph G = (V, E). Component labeling is numbering each vertex according to which component it belongs to. Sequential Component Labeling Algorithms Breadth-first search

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Union-find 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

{[ snackBarMessage ]}

Page1 / 6

Lecture15 - Union-find This is the equivalent to finding...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online