Applied Graph Theory
Download slides from hereGraph Theory:Introduction
Some Counting Problems
Euler Graphs and Digraphs
Matchings and Factors
Planarity
Graph Coloring
Proof Techniques
Degree Sequences & Digraphs
Trees
Cuts and Connectivity
Hamiltonian Cycles
complete slide -
- Graph Theory (PPT)
- Sequence Assembly (PPT)
| Lecture 1 | Sept 28 | Introduction and Stable Matching | Anderson | PPT | Slides with Ink | ||||||
| Lecture 2 | Sept 30 | Stable Matching | Anderson | PPT | Slides with Ink | ||||||
| Lecture 3 | Oct 3 | Efficient Algorithms | Anderson | PPT | Slides with Ink | ||||||
| Lecture 4 | Oct 5 | Models of Computation | Anderson | PPT | Slides with Ink | ||||||
| Lecture 5 | Oct 7 | Graph Theory | Anderson | PPT | Slides with Ink | ||||||
| Lecture 6 | Oct 10 | Graph Theory (Interaction Lecture) | Anderson | PPT | Slides with Ink Annotated Slides | ||||||
| Lecture 7 | Oct 12 | Greedy Algorithms | Anderson | PPT | Slides with Ink | ||||||
| Lecture 8 | Oct 14 | Greedy Algorithms | Anderson | PPT | Slides with Ink | ||||||
| Lecture 9 | Oct 17 | Dijkstra's Algorithm | Anderson | PPT | Slides with Ink | ||||||
| Lecture 10 | Oct 19 | Minimum Spanning Trees | Anderson | PPT | Slides with Ink | ||||||
| Lecture 11 | Oct 21 | Minimum Spanning Trees | Anderson | PPT | Slides with Ink | ||||||
| Lecture 12 | Oct 24 | Recurrences | Anderson | PPT | Slides with Ink | ||||||
| Lecture 13 | Oct 26 | Divide and Conquer | Anderson | PPT | Slides with Ink | ||||||
| Lecture 14 | Oct 28 | Divide and Conquer, FFT | Guruswami | ||||||||
| Lecture 15 | Oct 31 | Dynamic Programming | Karlin | ||||||||
| Lecture 16 | Nov 2 | Dynamic Programming | Karlin | ||||||||
| Lecture 17 | Nov 4 | Subset Sum, FFT | Guruswami | ||||||||
| Lecture 18 | Nov 7 | Dynamic Programming | Anderson | PPT | Slides with Ink | ||||||
| Lecture 19 | Nov 9 | Longest Common Subsequence | Anderson | PPT | Slides with Ink | ||||||
| Lecture 20 | Nov 14 | Memory Efficient LCS | Anderson | PPT | Slides with Ink | ||||||
| Lecture 21 | Nov 16 | Shortest Paths | Anderson | PPT | Slides with Ink | ||||||
| Lecture 22 | Nov 18 | Network Flow | Anderson | PPT | Slides with Ink | ||||||
| Lecture 23 | Nov 21 | Network Flow | Anderson | PPT | Slides with Ink | ||||||
| Lecture 24 | Nov 23 | Maxflow-Mincut Theorem | Anderson | PPT | Slides with Ink | ||||||
| Lecture 25 | Nov 28 | Netflow Applications | Anderson | PPT | Slides with Ink | ||||||
| Lecture 26 | Nov 30 | Open Pit Mining | Anderson | PPT | Slides with Ink | ||||||
| Lecture 27 | Dec 2 | Netflow Applications | Anderson | PPT | Slides with Ink | ||||||
| Lecture 28 | Dec 5 | NP-Completeness | Anderson | PPT | Slides with Ink | ||||||
| Lecture 29 | Dec 7 | NP-Completeness | Anderson | PPT | Slides with Ink | ||||||
| Lecture 30 | Dec 9 | NP-Completeness | Anderson | PPT | Slides with Ink |
No comments:
Post a Comment