*****COURSES ARE SUBJECT TO CHANGE*****
Basic concepts and algorithms are reviewed including trees, Eulerian and Hamiltonian graphs, and graph transversal. Algorithms are explored to solve problems in connectivity, routing, matching, and embedding of graphs. Graph theory and algorithms are developed around applications in computer engineering. Prerequisite(s): Computer Science 101. M. Schlag
While the information on this web site is usually the most up to date, in the event of a discrepancy please contact your adviser to confirm which information is correct.