User talk:David Eppstein/Graph Algorithms
Appearance
![]() | Computing NA‑class | ||||||
|
Goals
This is intended to cover graph algorithms at an upper-division undergraduate level, for students already familiar with the design and analysis of algorithms. I used a similar grouping of topics to the Spring 2010 offering of ICS 163 at UC Irvine, which I taught primarily from Wikipedia articles rather than from a text; however, I have not (yet?) included the motivating applications from that offering, and I included some additional topics to allow for some choice as well as the possibility of stretching the course to semester length. —David Eppstein (talk) 03:52, 12 July 2010 (UTC)