Prerequisite Courses:

Course Language:

English

Course Objectives:

This course aims to define basic concepts of graph theory and network flows and to provide an introduction to the algorithms and fundamental methods used to solve important problems in graph theory and network flows.

Course Content:

Topics covered include the structure and solution approaches of the problems in graph theory and network flows. Particularly, shortest path problem, minimum spanning tree problem, maximum flow problem, minimum cost network flow problem, transportation problem, colouring problem, Chinese postman problem, Hamiltonian cycle problem and matching problems will be discussed.

Course Methodology:

1: Lecture, 2: Question-Answer

Course Evaluation Methods:

A: Testing, B: Experiment, C: Homework