Course: Theory of Graphs and Games

» List of faculties » FM » NTI
Course title Theory of Graphs and Games
Course code NTI/TGHE
Organizational form of instruction Lecture + Lesson
Level of course Bachelor
Year of study not specified
Semester Summer
Number of ECTS credits 4
Language of instruction Czech
Status of course Compulsory, Compulsory-optional
Form of instruction Face-to-face
Work placements Course does not contain work placement
Recommended optional programme components None
Lecturer(s)
  • Březina Jan, doc. Mgr. Ph.D.
  • Špetlík Martin, Ing.
Course content
This course is focused on game theory, applied graph theory and decision making theory. First part containing graph themes, which will also include some classical optimization problem formulations on graphs and nets. Following part will be focused on general and also special cases of graph theory and its applications. Goal of the course is to know not only elemental theoretical relations but also their applications in operational research problems.

Learning activities and teaching methods
Monological explanation (lecture, presentation,briefing)
  • Class attendance - 56 hours per semester
  • Home preparation for classes - 64 hours per semester
  • Preparation for exam - 30 hours per semester
Learning outcomes
This course is focused on game theory, applied graph theory and decision making theory. First part containing graph themes, which will also include some classical optimization problem formulations on graphs and nets. Following part will be focused on general and also special cases of graph theory and its applications. Goal of the course is to know not only elemental theoretical relations but also their applications in operational research problems.
Students will acquire the basic concepts of the graph theory and other treated subjects, especially when applied to solving practical problems. In particular, the student will understand the importance of internal graph structure in solving real-world problems, theory and practice of programming.
Prerequisites
Basic programming, basic linear algebra.

Assessment methods and criteria
Combined examination

Recommended literature
  • Cormen, T. H., Leiserson, C. E., Rivest, R. L., Stein C. Introduction to Algorithms. MIT Press, 1990.
  • J. Černý. Základní grafové algoritmy, on-line: http://kam.mff.cuni.cz/~kuba/ka/.
  • J. Matoušek, J. Nešetřil. Kapitoly z diskrétní matematiky. Karolinum, 2009. ISBN 80-246-0084-.
  • J. Nešetřil:. Teorie grafů.. SNTL Praha, 1979.
  • M. Maňas:. Teorie her a její ekonomické aplikace.. SNTL, Praha, 1992.


Study plans that include the course
Faculty Study plan (Version) Category of Branch/Specialization Recommended year of study Recommended semester