CSE 589Applied AlgorithmsSpring 1999

Table of Contents

CSE 589Applied AlgorithmsSpring 1999

Performance of W-Union / PC-Find

Worst Case for PC-Find

Example of Worst Cast (cont’)

Amortized Complexity

Recall Kruskal

Evaluation of Kruskal

Prim’s Algorithm

Prim’s Algorithm 2

Prim’s Algorithm 3

Prim’s Algorithm 4

Prim’s Algorithm 5

Prim’s Algorithm 6

Prim’s Algorithm 7

Data Structures for Prim

Data Structures for Prim

Evaluation of Prim

Kruskal vs Prim

Load Balanced Spanning Tree (LBST)

Spanning Tree of Degree 3

Spanning Tree of Degree 2

Optimization Version of LBST

Equivalence of two versions

LBST Decision Problem

Classes of Problems

Hamiltonian Path Decision Problem

Hamiltonian Path Reducible to Spanning Tree of Degree 2

Hamiltonian Path is Reducible Spanning Tree of Degree k for any k

HP reducible to LBST of Degree 4

HP reducible to LBST of Degree 4 (2)

HP Reducible to LBST of Degree 4 (3)

HP reducible to LBST of Degree 4 (4)

Email: ladner@cs.washington.edu

Home Page: http://www.cs.washington.edu/education/courses/589/CurrentQtr/

Other information:
CSE 589: Applied Algorithms

Download presentation source