Syllabus

Graphs paths and circuits, trees and fundamental circuits, cut ‐ sets and cut - vertices, planar and dual graphs, vector spaces of graphs, matrix representation of graphs; transport networks, maximal flow, linear programming, minimal cut, maxflow ‐ mincut theorem, minimal ‐ cost flows, multicommodity flow, activity network, game theory.