SubjectsSubjects(version: 837)
Course, academic year 2018/2019
   Login via CAS
Graph Algorithms II - NDMI088
Title in English: Grafové algoritmy II
Guaranteed by: Department of Applied Mathematics (32-KAM)
Faculty: Faculty of Mathematics and Physics
Actual: from 2018
Semester: summer
E-Credits: 3
Hours per week, examination: summer s.:2/0 Ex [hours/week]
Capacity: unlimited
Min. number of students: unlimited
State of the course: not taught
Language: Czech
Teaching methods: full-time
Additional information: http://mj.ucw.cz/vyuka/ga2
Guarantor: Mgr. Martin Mareš, Ph.D.
Class: Informatika Mgr. - volitelný
Classification: Informatics > Discrete Mathematics
Annotation -
Last update: doc. Mgr. Milan Hladík, Ph.D. (02.05.2013)
This course covers advanced graph algorithms, techniques of their design, and related data structures. It extends the Graph algorithms course (NDMI010).
Course completion requirements - Czech
Last update: Mgr. Martin Mareš, Ph.D. (02.03.2018)

Předmět je zakončen zkouškou, u níž se ověřuje porozumění látce z přednášky a schopnost aplikovat ji na řešení obdobných problémů.

Literature -
Last update: doc. Mgr. Milan Hladík, Ph.D. (02.05.2013)

Alexander Schrijver: Combinatorial Optimization, Springer, 2003

Syllabus -
Last update: doc. Mgr. Milan Hladík, Ph.D. (02.05.2013)

Network flows: Goldberg's algorithm and its kin.

Accelerating flow algorithms on sparse graphs using Sleator-Tarjan Trees.

Description of minimum cuts by Gomory-Hu Trees.

Data structures for integers: Van Emde-Boas Trees, Q-Heaps, atomic heaps.

Minimum spanning trees: Integer algorithms, verification of minimality, Pettie's optimal algorithm.

 
Charles University | Information system of Charles University | http://www.cuni.cz/UKEN-329.html