IE 515 Graphs and Network Flows
Credit Information:
(3+0+0) 3
Description:
Introduction to graph theory; graph search; data structures for graph and network flow algorithms; shortest path problems; minimum spanning tree problem; matching in bipartite graphs; maximum flow - minimum cut and minimum cost circulation problems.
Offered by:
Syllabus:
