
Previous course: C0127 
Offered by:
Department of Mathematics
(MAT) 
No credit points with: C0127 
Prerequisite: 01010/01011 eller 01000/01001 . 01012/01013/01014 . 01015/01016 
Recommended semester:
4th 7th semester 
Scope and form: 2 lecture modules and one hour of problem solving per week. 
Examination:
Written exam
(13 point scale
) 
Contact person: 
Carsten Thomassen, MAT, Building 303, Tel. +45 4525 3058 

Aim: The main aim of this course is to present to the students some basic results and proof techniques in graph theory, in particular in connection with graph theoretic algorithms and with electrical networks. 
Contents: Basic graph theory. Network flow theory which constitute the foundation of combinatoral optimization with applications in e. g. operations research. Description and complexity of algorithms (shortest paths, spanning trees of minimal weight, the Chinese Postman's problem, sorting) of interest in computer science. The mathematical foundation of electrical networks. Random walks. 