CSc I0900 Graph Theory and Algorithms

Extremal graph theory. Drawing planar graphs. Elementary graph algorithms (breadth-first search, depth-first search, topological sort). Minimum spanning trees. Single-source shortest paths. Maximum bipartite matching. Connectivity of graphs. Random graphs.

Credits

3

Prerequisite

CSC 22000 or equivalent.

Contact Hours

3 hr./wk.