Algorithmic Graph Theory

Catalog description

Introduces graphs and algorithmic complexity; graph search; trees; paths and distance; Eulerian and Hamiltonian Graphs; Traveling Salesman Problem; and selected topics such as planarity, graph coloring, network flows, matchings, and factorizations. Recommended Preparation: CS 211 and MATH 472 , with a grade of C (2.0) or better. Enrollment Requirement(s): For Graduate students: CS 111 , and either MATH 378 or MATH 474 , all with a grade of C (2.0) or better. Prerequisite(s): For Undergraduate students: CS 111 , and either MATH 378 or MATH 474 , all with a grade of C (2.0) or better.