GRAPH THEORY AND APPLICATIONS

Instructor: Dr. Aysegul Yayimli
Time: Wednesday, 9.30-12.20
Classroom: Bilisim Enstitusu, 408

Announcements
31.05.2017: Graph Theory Final Exam will be held in room EEF 5304, on Wed. 7th June 2017, 12.00-14.00.
10.04.2017: Class is canceled for 12 April 2017.

Course Description
The aim of the course is to gain knowledge on graphs and its applications in computer engineering. The course covers data structures related to graphs, trees, shortest path algorithms, planar graphs, connectivity, graph coloring, matching, network flows, digraphs, NP-complete problems.

Course Books
Graph Theory, F. Harary, Addison-Wesley, 1972, ISBN -201-02787-9.
Algorithmic Graph Theory, A. Gibbons, Cambridge University Press, 1985, ISBN 0-521-28881-9.

Reference Books
Graph Theory with Applications, J.A. Bondy, U. S. R. Murty, North-Holand, 1976. (e-book available through the authors web page)
Network Flows: Theory, Algorithms, and Applications, R. Ahuja, L. Magnanti, J. B. Orlin, Prentice Hall, 1993, ISBN 0-136-17549-X.

Course Material
Lecture 1
Lecture 2
Lecture 3
Lecture 4
Lecture 5
Lecture 6
Lecture 7-8
Lecture 9
Lecture 10
Lecture 11

Midterm Dates
First Midterm: March 15th, 2017
Second Midterm: May 3rd, 2017

Sample Exams
Sample 1
Sample 2
Sample 3
Grading


Midterms: 25% + 25%
Final: 50%

Midterm 1 and Midterm 2 grades