MA 217 - Graphs, Networks, and Algorithms

Introduction to graphs, emphasizing their use as as a language for describing computational problems. Problems considered may include coloring, minimum spanning tree, conflict scheduling, optimal assignment, and bioinformatics. We cover graph algorithms such as traversal, shortest path, and network flow. Additional topics may include algorithm analysis and computational intractability.

Credits: 4

Prerequisites/Restrictions: MA-150 and (CS-109, CS-111, or DS-203) or Permission of Instructor.