Computational Complexity in Graph Theory
| Thesis title in Czech: | Výpočetní složitost v teorii grafů |
|---|---|
| Thesis title in English: | Computational Complexity in Graph Theory |
| Key words: | Seidelovo přepnutí, teorie grafů, výpočetní složitost, problém trhu s domy, ekonomické ekvilibrium |
| English key words: | Seidel's switching, graph theory, computational complexity, Housing Market problem, economic equilibrium |
| Academic year of topic announcement: | 2006/2007 |
| Thesis type: | dissertation |
| Thesis language: | angličtina |
| Department: | Department of Applied Mathematics (32-KAM) |
| Supervisor: | prof. RNDr. Jan Kratochvíl, CSc. |
| Author: | hidden - assigned and confirmed by the Study Dept. |
| Date of registration: | 01.10.2006 |
| Date of assignment: | 01.10.2006 |
| Date and time of defence: | 02.06.2016 15:30 |
| Date of electronic submission: | 13.04.2016 |
| Date of submission of printed version: | 13.04.2016 |
| Date of proceeded defence: | 02.06.2016 |
| Opponents: | Dr. David Manlove |
| doc. RNDr. Jiří Fiala, Ph.D. | |