Description

An introduction to the theory of undirected and directed finite graphs. Topics include the Konigsberg Bridge Problem, planar and non-planar graphs, the five-color theorem and the four-color theorem, Hamiltonian circuits, shortest path algorithms, and problems of network flow. This course may be applied toward the mathematics requirement for a major in computer science. Prerequisite: MATH*205 with a grade of "C" or better, or permission of the instructor. Distribution Requirements: SP.

Credits

4

Recent Professors

Schedule Planner

Recent Semesters

Fall 2018

Offered

MWF

Avg. Class Size

18

Avg. Sections

1