Selected Topics in Algorithms and Complexity
Level of Study
Objectives and Content
The course deals with current topics in algorithms and complexity, and its content will vary from time to time the course is taught.
Topic Spring 2023: Algorithms for graphs of bounded width
On completion of the course the student should have the following learning outcomes defined in terms of knowledge, skills and general competence:
The student knows the main methods and definitions in the considered field/topic.
The student is able to apply the main methods and definitions in the considered field in order to solve concrete problems.
The student is able to do research in the considered field as part of an MSc or PhD degree.
Required Previous Knowledge
At least 120 ECTS in computer science, preferably including some mathematics
Access to the Course
Access to the course requires admission to a master's programme at The Faculty of Mathematics and Natural Sciences
Teaching and learning methods
There are 2-4 hours of lectures every week. When possible, there are also 2 hours of group sessions every week.
Forms of Assessment
Examination Support Material
Pass / Fail
The reading list will be available within June 1st for the autumn semester and December 1st for the spring semester
The course will be evaluated by the students in accordance with the quality assurance system at UiB and the department.
The Programme Committee is responsible for the content, structure and quality of the study programme and courses.
Course coordinator and administrative contact person can be found on Mitt UiB, or contact
The Faculty of Mathematics and Natural Sciences represented by the Department of Informatics is the course administrator for the course and study programme.
T: 55 58 42 00
Type of assessment: Oral examination
- Withdrawal deadline
- Examination result announcement