1. Deutsch
  2. English

Module Description

Combinatorial Structures and Algorithms

Courses:

TitleTypeHrs/WeekPeriod
Combinatorial Structures and AlgorithmsLecture3Winter Semester
Combinatorial Structures and AlgorithmsRecitation Section (small)1Winter Semester

Module Responsibility:

Prof. Anusch Taraz

Admission Requirements:

None

Recommended Previous Knowledge:

Educational Objectives:

Professional Competence

Theoretical Knowledge
Capabilities

Personal Competence

Social Competence
Autonomy

ECTS-Credit Points Module:

6 ECTS

Examination:

Oral exam

Workload in Hours:

Independent Study Time: 124, Study Time in Lecture: 56


Course: Combinatorial Structures and Algorithms

Lecturer:

Anusch Taraz

Language:

German & English

Period:

Winter Semester

Content:

  • Counting
  • Structural Graph Theory
  • Analysis of Algorithms
  • Extremal Combinatorics
  • Random discrete structures

Literature:

  • M. Aigner: Diskrete Mathematik, Vieweg, 6. Aufl., 2006
  • J. Matoušek & J. NešetÅ™il: Diskrete Mathematik - Eine Entdeckungsreise, Springer, 2007
  • A. Steger: Diskrete Strukturen - Band 1: Kombinatorik, Graphentheorie, Algebra, Springer, 2. Aufl. 2007
  • A. Taraz: Diskrete Mathematik, Birkhäuser, 2012.

ECTS-Credit Points Course:

6 ECTS