Jump to content

User talk:David Eppstein/Graph Algorithms

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by David Eppstein (talk | contribs) at 03:52, 12 July 2010 (banner, goals). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Template:WBOOKS

WikiProject iconComputing NA‑class
WikiProject iconThis page is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
NAThis page does not require a rating on Wikipedia's content assessment scale.

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)[reply]