Welcome,
Guest
.
Login
.
Türkçe
NİNOVA
COURSES
HELP
ABOUT
Where Am I:
Ninova
/
Courses
/
Institute of Science and Technology
/
BLG 549E
/
Course Informations
Return to Faculty
Home Page
Course Information
Course Weekly Lecture Plan
Course Evaluation Criteria
Course Information
Course Name
Turkish
Çizge Kuramı ve Algoritmaları
English
Graph Theory and Algorithms
Course Code
BLG 549E
Credit
Lecture
(hour/week)
Recitation
(hour/week)
Laboratory
(hour/week)
Semester
1
3
3
-
-
Course Language
English
Course Coordinator
Berk Canberk
Course Objectives
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 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 Outcomes
Pre-requisite(s)
Required Facilities
Other
Textbook
Other References
Courses
.
Help
.
About
Ninova is an ITU Office of Information Technologies Product. © 2024