Graph Theory
Code | Completion | Credits | Range | Language |
---|---|---|---|---|
611Y1TG | KZ | 2 | 2P+0C | Czech |
- Garant předmětu:
- Lecturer:
- Tutor:
- Supervisor:
- Department Děčín
- Synopsis:
-
Basic concepts and terminology of graph theory, graph representation. Problems of graph theory, problem instance.
Graph search algorithms, trees, minimum spanning tree, shortest path problem, Eulerian path, bipartite graph matching, flow networks, circulations, critical path method, traveling salesman problem.
Problem of existence and optimization and algorithms for their solving. Computational complexity,dealing with NP-complete problems, heuris
- Requirements:
-
Graph theory basics
- Syllabus of lectures:
- Syllabus of tutorials:
- Study Objective:
-
Deeper understanding of graph theory basics. Learning of bacis concepts and problems in the field of algoritmization. Classical problems of graph theory and algorithms for their solving. Introducing to time complexity and efficiency of algorithms.
- Study materials:
-
Demel, J: Grafy a jejich aplikace, Praha, Academia, 2002
Matoušek, J., Nešetřil, J.: Kapitoly z diskrétní matematiky, Praha, Karolinum, 2009
- Note:
- Further information:
- No time-table has been prepared for this course
- The course is a part of the following study plans: