CS 598 CSC
CS 598 CSC - Topics in Graph Algorithms
Fall 2024
| Title | Rubric | Section | CRN | Type | Hours | Times | Days | Location | Instructor |
|---|---|---|---|---|---|---|---|---|---|
| Topics in Graph Algorithms | CS598 | CSC | 63589 | S1 | 4 | 1100 - 1215 | T R | 0216 Siebel Center for Comp Sci | Chandra Chekuri |
See full schedule from Course Explorer
Official Description
Subject offerings of new and developing areas of knowledge in computer science intended to augment the existing curriculum. See Class Schedule or departmental course information for topics and prerequisites. Course Information: May be repeated in the same or separate terms if topics vary.
Section Description
The field of graph algorithms has seen a number of fundamental advances in the
last few years including much faster algorithms for classical problems such as
shortest paths, flows, and cuts. A diverse set of ideas have contributed to these
developments. The course will cover some of these new results and the relevant
technical background. Background in algorithms at the level of CS 473 and
mathematical maturity is expected.
For up-to-date information about CS course restrictions, please view the following link for restrictions and release dates: http://go.cs.illinois.edu/csregister.