Přístupnostní navigace
E-application
Search Search Close
Course detail
FAST-HA53Acad. year: 2024/2025
Various types of graphs and their applications. Basic structures defined for graphs used for their classification. Tractable and intractable combinatorial problems as modelled by graphs. Essential algorithms used to solve graph problems. Theory of NP-completeness.
Language of instruction
Number of ECTS credits
Mode of study
Guarantor
Department
Entry knowledge
Rules for evaluation and completion of the course
Aims
Study aids
Prerequisites and corequisites
Basic literature
Recommended literature
Exercise
Teacher / Lecturer
Syllabus