Code |
Course Name |
Language |
Type |
YZV 413E |
Graph Theory and Algorithms |
English |
Elective |
Local Credits |
ECTS |
Theoretical |
Tutorial |
Laboratory |
3 |
4 |
3 |
0 |
0 |
Course Prerequisites and Class Restriction |
Prerequisites |
(YZV 231E MIN DD or MAT 271 MIN DD or MAT 271E MIN DD) and YZV 202E MIN DD
|
Class Restriction |
None |
Course Description |
Data structures related to graphs, graphs in computer engineering, basic definitions, trees,
shortest path algorithms, planar graphs, connectivity, Euler and Hamilton graphs, graph
coloring, matching, network flows, digraphs, NP-complete problem |
|