CS 668 Graphs, Algorithms, and Applications

Concepts of graph theory. Algorithms for graph traversal, shortest paths, connectivity, spanning trees, and matchings. Applications of graphs to computer programming, software engineering, VLSI design, networks and flows, bioinformatics, and parallel programming.

Prerequisites: CS 601 and 602 or permission of the graduate program director