{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

CSE5311M3 - Module 3 Graph Algorithms This week Graph...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
1 Module 3 - Graph Algorithms This week G h t i l Graph terminology Stacks and Queues Breadth-first-search Depth-first-search Connected Components Analysis of BFS and DFS Algorithms 8/30/2009 M KUMAR CSE5311 1 Please see Reference Books Course Syllabus Review of Asymptotic Analysis and Growth of Functions, Recurrences Sorting Algorithms Graphs and Graph Algorithms. Greedy Algorithms : Minimum spanning tree,Union-Find algorithms, Kruskal's Algorithm, Clustering, Huffman Codes, and Multiphase greedy algorithms. Dynamic Programming : Shortest paths, negative cycles, matrix chain multiplications, sequence alignment, RNA secondary structure, application examples. Network Flow : Maximum flow problem, Ford-Fulkerson algorithm, augmenting paths, Bipartite matching problem, disjoint paths and application problems . 8/30/2009 M KUMAR CSE5311 2 NP and Computational tractability : Polynomial time reductions; The Satisfiability problem; NP-Complete problems; and Extending limits of tractability. Approximation Algorithms, Local Search and Randomized Algorithms
Background image of page 1

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

View Full Document Right Arrow Icon