 Course goals
After completing this course, the student will have...

Knowledge of important network algorithms

Knowledge of important algorithmic techniques and concepts

Ability to model problems from applications as an (algorithmic) network problem

Ability to apply algorithmic techniques, to solve algorithmic network problems

Ability to
1fd
prove correctness of a network algorithm

Ability to formulate graph and network algorithms

Ability to analyse the running time of network algorithms
 Content
In this course a number of advanced techniques for efficient algorithm design are studied, often at the hand of problems from networks and graphs. In many applications, networks and graphs are used as a model. Typical examples are networks of roads, or electronic networks. In other applications, the graph model may be less obvious, but appears to be very useful, like for scheduling problems. In this course, the translation of problem to network model is treated, and algorithmic problems and their solutions on networks and graphs are looked into. Some topics are: shortest paths, flow, matchings, triangulated graphs, treewidth, graph isomorphism, graph drawing, exact algorithms for fundamental graph problems, small world networks, facility location.
 Entry requirementsYou must have a valid study entrance permit 

  Required materialsRecommended materialsHandoutsMost literature will be handed out during the course. 
 Instructional formats (attendance required)Lecture (Required)

 TestsFinal resultTest weight   100 
Minimum grade    


 