|
|
|
||
Poslední úprava: RNDr. Ondřej Pangrác, Ph.D. (06.05.2019)
|
|
||
Poslední úprava: Irena Penev, Ph.D. (14.06.2019)
There will be an oral exam consisting of a presentation of one research paper. |
|
||
Poslední úprava: RNDr. Ondřej Pangrác, Ph.D. (06.05.2019)
Lecture notes and research papers. |
|
||
Poslední úprava: Irena Penev, Ph.D. (30.09.2019)
The syllabus varies from year to year and is given at the beginning of the semester. Topics usually include perfect graphs and related classes, as well as polynomial-time algorithms (especially those solving the recognition, optimal coloring, maximum clique, and maximum stable set problems) for those classes.
Syllabus for Winter 2019/2020: https://iuuk.mff.cuni.cz/~ipenev/NDMI105Winter2019.html |