Discretni cast. Literatura: lecture notes and Cook, Cunningham, Pulleyblank, Schrijver, Combinatorial Optimisation, Wiley 1998.
Cviceni: Je nutne absolvovat diskretni i spojitou cast. Pro zapocet z diskretni casti je nutne jedno z nasledujicich: a. pisemny test nebo b. tymova prezentace zajimaveho tematu souvisejiciho s prednaskou, nebo c. tymova prezentace vypoctovych experimentu souvisejicich s prednaskou.
Unor 22: uvod, opakovani zakladnich pojmu teorie grafu, eulerovska prochazka, prostor cyklu grafu, Hamiltonovska kruznice, kostra grafu, rovinne grafy.
Unor 23 cviceni: opakovani zakladnich pojmu teorie grafu.
Unor 29: matroidy: zakladni definice, radova funkce, submodularita a jeji vyznam v modelovani utility.
Brezen 1 cviceni: basic notions of matroids, prove that vectorial and graphic "matroids" are indeed matroids. Prove that U(2,4) is not representable over F2.
Brezen 7: matroidy: hladovy algoritmus, dualni matroid, grafovy matroid
Brezen 8 cviceni: Let G be an embedded planar graph. Proof that the dual of its graphic matroid is isomorphic to the graphic matroid of its geometric dual.
Brezen 14: parovani v grafech, Tutte-Berge Theorem, Edmonds algorithm
Brezen 21: parovani a hranove rezy v rovinnych grafech, Isingova particni funkce
Brezen 28: Chinese postman problem a Problem obchodniho cestujiciho (TSP)