MATHEMATICS (TURKISH, PHD) | |||||
PhD | TR-NQF-HE: Level 8 | QF-EHEA: Third Cycle | EQF-LLL: Level 8 |
Course Code | Course Name | Semester | Theoretical | Practical | Credit | ECTS |
MAT6005 | Combinatorics and Graph Theory | Fall | 3 | 0 | 3 | 12 |
The course opens with the approval of the Department at the beginning of each semester |
Language of instruction: | Tr |
Type of course: | Departmental Elective |
Course Level: | |
Mode of Delivery: | Face to face |
Course Coordinator : | Assoc. Prof. ATABEY KAYGUN |
Course Objectives: | A survey of Concepts of Graph Theory and its applications. |
The students who have succeeded in this course; Able to give an optimization problems Provides advanced concepts of graph models |
Algorithmic Graph Theory and its Applications, Interval Graphs, Interval Graphs and its applications, Intersection Graphs, Tolerance Graphs, NeST Graphs, Decompositions and Forcing Relations in Graphs and Other Combinatorial Structures Domination Analysis of Combinatorial Optimization Algorithms and Problems |
Week | Subject | Related Preparation | |
1) | Optimization Problems Related to Internet Congestion Control | ||
2) | Problems in Data Structures and Algorithms | ||
3) | Search Trees ,The Minimum Spanning Tree Problem | ||
4) | Interval graphs | ||
5) | Interval graphs and applications | ||
6) | Tolerance Graphs | ||
7) | Interval Probe Graphs | ||
8) | NeST Graphs | ||
9) | Intersection graph | ||
10) | Comparability relation and comparability graph | ||
11) | Graph Modules and The Γ Relation | ||
12) | Modular Decomposition and Transitive Orientation | ||
13) | Domination Analysis of Combinatorial Optimization Algorithms and Problems | ||
14) | Domination Analysis of Combinatorial Optimization Algorithms and Problems |
Course Notes: | Martin Charles Golumbic, Irith Ben-Arroyo Hartman, “Graph Theory, Combinatorics and Algorithms” , Copyright C_ 2005 by Springer Science + Business Media, Inc. |
References: |
Semester Requirements | Number of Activities | Level of Contribution |
Attendance | % 0 | |
Laboratory | % 0 | |
Application | % 0 | |
Field Work | % 0 | |
Special Course Internship (Work Placement) | % 0 | |
Quizzes | 3 | % 10 |
Homework Assignments | % 0 | |
Presentation | % 0 | |
Project | % 0 | |
Seminar | % 0 | |
Midterms | 2 | % 40 |
Preliminary Jury | % 0 | |
Final | 1 | % 50 |
Paper Submission | % 0 | |
Jury | % 0 | |
Bütünleme | % 0 | |
Total | % 100 | |
PERCENTAGE OF SEMESTER WORK | % 50 | |
PERCENTAGE OF FINAL WORK | % 50 | |
Total | % 100 |
Activities | Number of Activities | Duration (Hours) | Workload |
Course Hours | 14 | 3 | 42 |
Laboratory | 0 | 0 | 0 |
Application | 0 | 0 | 0 |
Special Course Internship (Work Placement) | 0 | 0 | 0 |
Field Work | 0 | 0 | 0 |
Study Hours Out of Class | 14 | 5 | 70 |
Presentations / Seminar | 0 | 0 | 0 |
Project | 0 | 0 | 0 |
Homework Assignments | 0 | 0 | 0 |
Quizzes | 3 | 2 | 6 |
Preliminary Jury | 0 | ||
Midterms | 2 | 20 | 40 |
Paper Submission | 0 | ||
Jury | 0 | ||
Final | 1 | 42 | 42 |
Total Workload | 200 |
No Effect | 1 Lowest | 2 Low | 3 Average | 4 High | 5 Highest |
Program Outcomes | Level of Contribution |