Přístupnostní navigace
E-application
Search Search Close
Course detail
FSI-VTG-KAcad. year: 2011/2012
The course provides an introduction to graph theory and familiarises students with basic terms. It deals with the following topics: Graph representation. Time complexity of algorithms. Data structures (binary heap, disjoint sets, ...). Eulearian trails, Hamiltonian paths.Breadth-first searching, depth-first searching, backtracking, branch and bound method. Connectivity and reachability. Shortest path problems (Dijkstra's algorithm, Floyd-Warshall algorithm). Network graphs. Trees, spanning tree problem, Steiner tree problems. Fundamentals of computational geometry, Voronoi diagrams, Delaunay triangulation.Network flows. Graph colouring. Graph matching.
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
Recommended literature
Classification of course in study plans
branch M-AIŘ , 2 year of study, winter semester, compulsorybranch M-AIŘ , 2 year of study, winter semester, compulsory
Guided consultation
Teacher / Lecturer
Syllabus