|
|
KMA/TGD1
Graph Theory, Optimization, Complexity 1
Guarantors: doc. Ing. Roman Čada, Ph.D.
|
| |
|
|
|
Course annotation
KMA/TGD1
-IS/STAG
The course gives a basic knowledge in Algorithmic Graph Theory and Computational Complexity.
The student will be able to use basic Graph-Theoretical concepts, to design algorithms for basic problems in Graph Theory and to understand their computational complexity. The student will have knowledge of elements of theory of NP-completeness and will be able to verify NP-completeness of selected problems in Graph Theory. |
|
|
| |
|
|
|
|
News
|
|
No news entered at the moment
|
|
|
|
|
|
![[RSS]](/zdroje/images/icons/rss.png){kind=icon}