Přístupnostní navigace
E-application
Search Search Close
Course detail
FAST-DAB033Acad. year: 2022/2023
Basics of graph theory, finding optimum graph solutions.Finding the cheapest spanning tree of a graph.Finding the shortest path in a graph.Determining the maximum flow in a network.NP-complete problems.Travelling salesman problem.Linear programming.Transport prpoblem.Integer programming.Basics of the theory of games.
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
Plesník, Ján: Grafové algoritmy. Bratislava: Veda 1983
Švrček J., Lineární programování v úlohách, Skriptum UP Olomouc 2003, ISBN 80-744-0705-1
Recommended reading
Rychetník, Zelinka, Pelzbauerová: Sbírka příkladů z lineárního programování. SNTL/ALFA 1968
DEMEL, J.: Grafy. SNTL, Sešit XXXIV 1989
Nešetřil, J. - Teorie grafů, SNTL 1979
Classification of course in study plans
Lecture
Teacher / Lecturer
Syllabus