SluitenHelpPrint
Switch to English
Cursus: INFOAN
INFOAN
Algorithms and networks
Cursus informatieRooster
CursuscodeINFOAN
Studiepunten (ECTS)7,5
Categorie / NiveauM (Master)
CursustypeCursorisch onderwijs
VoertaalEngels
Aangeboden doorFaculteit Betawetenschappen; Graduate School of Natural Sciences;
Contactpersoondr. H.L. Bodlaender
Telefoon+31 30 2534409
E-mailH.L.Bodlaender@uu.nl
Docenten
Docent
dr. H.L. Bodlaender
Feedback en bereikbaarheid
Overige cursussen docent
Blok
2  (13-11-2017 t/m 02-02-2018)
Aanvangsblok
2
TimeslotB: DI-ochtend, DO-middag, DO-namiddag
Onderwijsvorm
Voltijd
Opmerkinghttp://www.cs.uu.nl/education/vak.php?vak=INFOAN
Cursusinschrijving geopendvanaf 18-09-2017 t/m 01-10-2017
AanmeldingsprocedureOsiris
Inschrijven via OSIRISJa
Inschrijven voor bijvakkersJa
VoorinschrijvingNee
Na-inschrijvingJa
Na-inschrijving geopendvanaf 23-10-2017 t/m 24-10-2017
WachtlijstJa
Plaatsingsprocedureadministratie onderwijsinstituut
Cursusdoelen
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 prove correctness of a network algorithm
  • Ability to formulate graph and network algorithms
  • Ability to analyse the running time of network algorithms
Inhoud
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.
Ingangseisen
Je moet een geldige toelatingsbeschikking hebben
Verplicht materiaal
-
Aanbevolen materiaal
Handouts
Most literature will be handed out during the course.
Werkvormen (aanwezigheidsplicht)
Hoorcollege (Verplicht)

Toetsen
Eindresultaat
Weging100
Minimum cijfer-

SluitenHelpPrint
Switch to English