Table of Contents
Welcome to CSE 589 -- Applied Algorithms
Administrivia
Other Announcements
Course Goals
Other
Plan For Today
Algorithm Design Goals
Keeping Score: The RAM Model of Computation
Types of complexity
Big Oh Notation
Growth Rates, etc.
Modeling the Problem
Two basic paradigms
Example DP Problem: Matrix Chain Multiplication
Dynamic Program for Matrix Chain Multiplication
Example: Approximate String Matching
Dynamic Program for AST
Dynamic Programming Summary
Graph Terminology
Traversing a Graph
Depth-First Search
Depth-First-Search
Applications of Graph Traversal
Applications of Graph Traversal
Topological Sorting
Applications of Graph Traversal
Planarity Testing
Minimum Spanning Trees
Prim’s algorithm
Priority Queue
Kruskal’s algorithm
Disjoint Set Data Structure Union/Find
Shortest Paths Dijkstra’s Algorithm
All-pairs shortest paths Floyd-Warshall
Matching
Graphs -- Summary
Your turn!!!!
Problems
Problems
Problems
Problems
Hard Graph Problems
Most notorious hard graph problem
Clique
Independent Set
Hamiltonian Cycle
Graph Partition
Vertex Coloring
Steiner Tree
|