Přístupnostní navigace
E-application
Search Search Close
Course detail
FSI-SGA-AAcad. year: 2014/2015
The course will provide students with basic concepts of the theory of graphs and with some algorithms based on that theory. After the basic definitions, the classic problems will be discussed including the Euler path and Hamilton cycle of a graph, vertex colouring, planar graphs etc. The next concept to be investigated will be trees and tree-based algorithms. Attention will also be paid to the problem of finding the shortest path in a graph. Students will also learn about bipartite graphs and matching problems. Oriented graphs will be introduced to build networks and flows in them and deal with algorithms used to find a critical path. The course will be oriented towards applications of graphs that can be found in many areas of practical life. Emphasis will be placed on applications in computer science, optimization and theory of control and in operation research.
Language of instruction
Number of ECTS credits
Mode of study
Guarantor
Department
Learning outcomes of the course unit
Prerequisites
Co-requisites
Planned learning activities and teaching methods
Assesment methods and criteria linked to learning outcomes
Course curriculum
Work placements
Aims
Specification of controlled education, way of implementation and compensation for absences
Recommended optional programme components
Prerequisites and corequisites
Basic literature
Recommended literature
Classification of course in study plans
branch M-MAI , 1 year of study, winter semester, compulsory
Lecture
Teacher / Lecturer
Syllabus
Exercise