CSCI 422: Advanced Algorithms, Fall 2019
Links to material referenced or useful to the course.
Handout from CSCI 260 (Big Oh Rules and Log Facts)
Self Quiz 0: Big Oh, ADTs, Algorithms
Jeff Erickson's Lecture Notes for a similar course
Lec 1,2,3: Intro; Array ADT; Dynamic Programming.
Dynamic Programming reference: CLRS Section 15.2
Also see Notes from Prof Dekai.
Lec 4, 5: Comparison-based sorts -- information theoretic lower bounds. Non-comparison based sorts: radix sort, counting sort, bucket sort.
Lec 6, 7: Gale-Shapley Algorithm for Stable matching. Max Bipartite Matching.
Network Flow algoriths: Ford and Fulkerson, Edmonds-Karp.
Max-Flow Min-cut reference:
and the slides from Florida State, based on Kevin Wayne's slides.
- Transitive Closure/All-pairs Shortest Paths reference:
- Posets -- Linear Extensions -- Bump Number -- Lexicographic Labellings:
slides from my Bump Number talk.
- Max Contiguous Sum Problem:
Fibonacci Heaps reference: see
Kevin Wayne's slides
and Stanford slides
Visualization, and Cornell notes,
MIT notes (Karger).