Graphs and Algorithms.

Catalog description

Semester course; 3 lecture hours. 3 credits. Prerequisite: MATH 201 with a minimum grade of C. An introduction to basic graph theoretic concepts such as trees, colorings and matchings; basic theorems such as the handshaking lemma and the Gallai identities; algorithms such as Dijkstra’s and Kruskal’s; and discussion of famous open problems such as finding shortest tours for a traveling salesman.