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: Minimum grade of C or better in CS 601 or CS 617, and CS 602, or permission of the graduate program director