|
Systems and programs are designed
for many purposes and in many ways, but it's algorithms that make things work.
Good algorithm design requires understanding and modelling
an application, and subsequently studying and analyzing the computational
features of the design. In this course we study a number of advanced techniques
for efficient algorithm design, often at the hand of problems from networks and
graphs. In many applications, networks and graphs are used as a model. Tyical 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, we
look to the translation of problem to network model, and we look to algorithmic problems and their solutions on networks and graphs. Some topics are: shortest
paths, flow, matchings, triangulated graphs, treewidth (with an application in probabilistic networks),
graph drawing, exact algorithms for fundamental graph problems, small world
networks.
http://www.cs.uu.nl/education/vak.php?vak=INFOAN&jaar=2008
|
|
|