FPF:UIN1070 Combinatorial Algorithms - Course Information
UIN1070 Combinatorial Algorithms
Faculty of Philosophy and Science in OpavaWinter 2010
- Extent and Intensity
- 2/2/0. 4 credit(s). Type of Completion: zk (examination).
- Guaranteed by
- RNDr. Miroslav Langer, Ph.D.
Institute of Computer Science – Faculty of Philosophy and Science in Opava - Course Enrolment Limitations
- The course is also offered to the students of the fields other than those the course is directly associated with.
- fields of study / plans the course is directly associated with
- Computer Science and Technology (programme FPF, N1801 Inf)
- Course objectives (in Czech)
- Grafy, reprezentace grafů, volba reprezentace v závislosti na aplikaci. Heldání nejkratší cesty v grafu. Eulerovské tahy, klika, Hamiltonovský cyklus.
- Language of instruction
- Czech
- Further Comments
- The course can also be completed outside the examination period.
- Enrolment Statistics (Winter 2010, recent)
- Permalink: https://is.slu.cz/course/fpf/winter2010/UIN1070