Combinatorial Optimization and Graph Algorithms

Enrollment Requirements: Graduate Prerequisite: Graduate Standing Design data structures and efficient algorithms for priority queues, minimum spanning trees, searching in graphs, strongly connected components, shortest paths, maximum matching, and maximum network flow. Some discussion of intractable problems and distributed network algorithms. Same as ENG EC 732, ENG ME 732. Students may not receive credits for both.