Information sheet ECTS Syllabus
Course syllabus B1-TG - Graph theory and applications (FCE - SS 2018/2019)
|University:||Slovak University of Technology in Bratislava|
|Faculty:||Faculty of Civil Engineering|
|Course unit code:||B1-TG|
|Course unit title:||Graph theory and applications|
|Mode of delivery, planned learning activities and teaching methods:|
|Recommended semester/trimester:||Mathematical and Computational Modeling - bachelor (compulsory), 2. semester|
|Level of study:||1.|
|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 or english|
|Assessed students in total: 48|
|Name of lecturer(s):||prof. RNDr. Martin Knor, PhD. (examiner, instructor, lecturer, person responsible for course, tutor) - slovak, english |
RNDr. Ľubica Staneková, PhD. (instructor)
|Last modification:||28. 2. 2019|
|Supervisor:||prof. RNDr. Martin Knor, PhD. and programme supervisor|
Last modification made by Ing. Peter Korčák on 02/28/2019.