SubjectsSubjects(version: 837)
Course, academic year 2018/2019
   Login via CAS
Algorithms for Specific Graph Classes - NDMI077
Title in English: Algoritmy pro specifické třídy grafů
Guaranteed by: Department of Applied Mathematics (32-KAM)
Faculty: Faculty of Mathematics and Physics
Actual: from 2018
Semester: summer
E-Credits: 3
Hours per week, examination: summer s.:2/0 Ex [hours/week]
Capacity: unlimited
Min. number of students: unlimited
State of the course: not taught
Language: English, Czech
Teaching methods: full-time
Guarantor: doc. RNDr. Jiří Fiala, Ph.D.
Class: Informatika Mgr. - volitelný
Classification: Informatics > Discrete Mathematics
Annotation -
Last update: JUDr. Dana Macharová (14.10.2008)
Special course for advanced undergraduate and graduate students devoted to algorithm design for restricted graph classes.
Literature -
Last update: JUDr. Dana Macharová (14.10.2008)
  • Diestel, R.: Graph Theory, graduate texts in mathematics, vol. 173., Springer Verlag, May 1997.
  • Kloks, T. Treewidth: Computations and approximations, no. 842 in Lecture Notes in Computer Science, Springer Verlag, 1994.
  • Časopisecká literatura podle specifikace přednášejícího.

Syllabus -
Last update: JUDr. Dana Macharová (14.10.2008)

In the course will be shown desing of effective algorithms for NP-hard problems on graphs of bounded treewidth. Some other graph classes (e.g. intersection graphs) will also be considered.

 
Charles University | Information system of Charles University | http://www.cuni.cz/UKEN-329.html