2011-2012 University Catalog 
  
2011-2012 University Catalog

CS 684 - Graph Algorithms

Credits: 3 (NR)
Data structures and analytical techniques to study graph algorithms. Data structures include disjoint sets, heaps, and dynamic trees. Algorithms include minimum spanning trees, shortest path, maximum flow, and graph planarity.

Prerequisite(s): CS 583.

Hours of Lecture or Seminar per week: 3
Hours of Lab or Studio per week: 0