Information sheet ECTS Syllabus
Course syllabus D1-TEGR - Graph theory (FCE - 2019/2020 - post-graduate studies)
|University:||Slovak University of Technology in Bratislava|
|Faculty:||Faculty of Civil Engineering|
|Course unit code:||D1-TEGR|
|Course unit title:||Graph theory|
|Mode of delivery, planned learning activities and teaching methods:|
|Recommended semester/trimester:||-- item not defined --|
|Level of study:||3.|
|Prerequisites for registration:||none|
|Passing two semestral tests.|
Obtaining at least 50% points on the exam.
|Learning outcomes of the course unit:|
|Student gets knowledge about the basic notions in graph theory. Among other applications, we discuss the minimum path problem, reachability, maximum flows in networks and matchings in bipartite graphs.|
- Basic notions in graph theory.
- Eulerian trails and Hamiltonian circuits, trees and spanning trees.
- Flows, connectivity, cuts and shortest paths.
- Transversals, matchings and the assignment problem.
- Colourings and decompositions.
- Matriods and the complexity of algorithms.
|Recommended or required reading:|
|Language of instruction:||slovak|
|Assessed students in total: 4|
|Name of lecturer(s):||prof. RNDr. Martin Knor, PhD. (examiner, instructor, lecturer) - slovak, english |
prof. RNDr. Jozef Širáň, DrSc. (examiner, instructor, lecturer, person responsible for course, tutor) - slovak, english
|Last modification:||31. 10. 2017|
|Supervisor:||prof. RNDr. Jozef Širáň, DrSc. and programme supervisor|
Last modification made by Ing. Peter Korčák on 10/31/2017.