Technische Universität Ilmenau

Graphs & Algorithms - Modultafeln of TU Ilmenau

The module lists provide information on the degree programmes offered by the TU Ilmenau.

Please refer to the respective study and examination rules and regulations for the legally binding curricula (Annex Curriculum).

You can find all details on planned lectures and classes in the electronic university catalogue.

Information and guidance on the maintenance of module descriptions by the module officers are provided at Module maintenance.

Please send information on missing or incorrect module descriptions directly to modulkatalog@tu-ilmenau.de.

module properties module number 200408 - common information
module number200408
departmentDepartment of Mathematics and Natural Sciences
ID of group2411 (Discrete Mathematics and Algebra)
module leaderProf. Dr. Matthias Kriesell
languageDeutsch
term Wintersemester
previous knowledge and experience

Lineare Algebra I und Lineare Algebra II

learning outcome

Die Studierenden kennen nach der Vorlesung typische Berechnungsprobleme und Algorithmen zu deren Lösung, wissen diese zu beschreiben. Sie haben dadurch auch grundlegende Kenntnisse der Theorie endlicher Graphen. Nach den Übungen sind sie fähig, die o. g. Kenntnisse zur Lösung einfacher anwendungsnaher Probleme einzusetzen, andererseits können sie die in der Vorlesung verwendeten Beweistechniken anwenden.

content

I. Bäume (Breiten- und Tiefensuchbäume, Matroidmethoden, Approximation optimaler Rundreisen, Baumweite, der Satz von Courcelle) II. Matchings (bipartiter Fall, allgemeine Faktorsätze) III. Flüsse (die Sätze von Ford-Fulkerson, Menger, Gutnikov) IV. Färbungen (Greedy-Färbung, die Sätze von Brooks und Vizing, Komplexität von Färbungsproblemen, der 4-Farben-Satz)

Die Inhalte können abhängig vom Dozenten variieren: Das Grundthema läßt hier ungeheuer viel Spielraum.

media of instruction and technical requirements for education and examination in case of online participation

Tafel

literature / referencesDie einschlägigen Lehrbücher von Diestel und Bondy-Murty.
evaluation of teaching
Details reference subject
module nameGraphs & Algorithms
examination number2400760
credit points5
SWS3 (2 V, 1 Ü, 0 P)
on-campus program (h)33.75
self-study (h)116.25
obligationobligatory module
examoral examination performance, 30 minutes
details of the certificate
alternative examination performance due to COVID-19 regulations incl. technical requirements
signup details for alternative examinations
maximum number of participants
Details in degree program Bachelor Mathematik 2021
module nameGraphs & Algorithms
examination number2400760
credit points5
on-campus program (h)34
self-study (h)116
obligationobligatory module
examoral examination performance, 30 minutes
details of the certificate
alternative examination performance due to COVID-19 regulations incl. technical requirements
signup details for alternative examinations
maximum number of participants
Details in degree program Bachelor Informatik 2013, Bachelor Informatik 2021, Master Informatik 2021
module nameGraphs & Algorithms
examination number2400760
credit points5
on-campus program (h)34
self-study (h)116
obligationelective module
examoral examination performance, 30 minutes
details of the certificate
alternative examination performance due to COVID-19 regulations incl. technical requirements
signup details for alternative examinations
maximum number of participants