*****COURSES ARE SUBJECT TO CHANGE*****
Explores graph theory and algorithms for solving problems in engineering. A review of basic graph concepts and algorithms is followed by topics in network flow, partitioning, spectral analysis of graphs, graph isomorphism, and intractability. Prerequisite(s): Computer Science 101 and 102; or course 177; or Computer Science 201; or equivalent. Enrollment restricted to graduate students. Enrollment limited to 20. 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.