| [full html][entry] |
Matroid theory |
Petr Hliněný FI MU Brno, CZ |
| (Petr Hliněný) Actual and supplementary teacher's information about the subject Matroid theory and combinatorial optimization at FI MU Brno, CZ. Students should read them regularly... | 19 February 2008 | |
MA053: |
Matroid theory | 2011 |
|---|---|---|
|
doc. RNDr. Petr Hliněný, Ph.D. (KTP FI MU) | Matroid theory and combinatorial optimization | |
|
lecture 2, class exercises 1, select another -, eng angličtina | zk zkouška ( z ) | |
| Hours: The jaro 2011 timetable will be released on Po 14. 2. 2011 | ||
|
News | ||
|
Course objectives. The aim of this advanced subject is to introduce students to basics of matroid theory and its connections to combinatorial optimization. Roughly saying, matroids present an algebraic/geometric generalization of graphs, and everybody should know their connection with the greedy algorithm... | ||
|
Prerequisites. Graph theory MA010, Linear algebra (ANY). | ||
|
Course organization. _AMT_V_ukov__metody_anglicky _AMT_Metody_hodnocen__anglicky | ||
|
Teacher's information. Study texts: * James Oxley, What is a matroid?, 2003. "http://www.math.lsu.edu/~oxley/survey4.pdf" * Alexander Schrijver, A course in combinatorial optimization, 2004. "http://homepages.cwi.nl/~lex/files/dict.pdf" | ||
Created by © Petr Hliněný
Faculty of Informatics MU Brno, CZ
19 February 2008
[full html][entry] [me][work][publ][teach] [photo][link] [mé][práce][výuka] [new!][IS MU] [cesky]