Slozitost kombinatorickych algoritmu
| Thesis title in Czech: | Slozitost kombinatorickych algoritmu |
|---|---|
| Thesis title in English: | Complexity of combinatorial algorithms |
| Key words: | graf,algoritmus,NP-uplnost,TSP |
| English key words: | graphs,algorithms,NP-completeness,TSP |
| Academic year of topic announcement: | 2015/2016 |
| Thesis type: | dissertation |
| Thesis language: | |
| Department: | Computer Science Institute of Charles University (32-IUUK) |
| Supervisor: | prof. RNDr. Jaroslav Nešetřil, DrSc. |
| Author: | Michal Čertík, M.Sc. - assigned and confirmed by the Study Dept. |
| Date of registration: | 03.10.2016 |
| Date of assignment: | 03.10.2016 |
| Confirmed by Study dept. on: | 05.10.2016 |
| Guidelines |
| samostatna vedecka a odborna prace dle pokynu skolitele |
| References |
| Hell,Nesetril: Graphs and homomorphisms
Nesetril,Ossona de Mendez: Sparsity Matousek, Nesetril: Invitation to DM casopisecka literatura |