IE 512 Graph Theory and Network Flows Select Term:
Theory and applications of graphs and networks; properties of graphs; Hamiltonian and Eulerian walk problems; Travelling salesman problem and variants; design and analysis of shortest path, maximum flow and minimum cost network flow algorithms; matching and assignment; network simplex algorithm.
SU Credits : 3
ECTS Credit : 10
Prerequisite : -
Corequisite : -