ATTENTION/WARNING - NE PAS DÉPOSER ICI/DO NOT SUBMIT HERE

Ceci est la version de TEST de DIAL.mem. Veuillez ne pas soumettre votre mémoire sur ce site mais bien à l'URL suivante: 'https://thesis.dial.uclouvain.be'.
This is the TEST version of DIAL.mem. Please use the following URL to submit your master thesis: 'https://thesis.dial.uclouvain.be'.
 

Study and analysis of network flows

Genon, Denis ; Velghe, Victor
(2016)

Files

Genon_11960900_Velghe_88521000_2016.pdf
  • Open access
  • Adobe PDF
  • 3.45 MB
Download

Details

Supervisors
Deville, Yves
Faculty
Ecole polytechnique de Louvain
Degree label
Master [120] en sciences informatiques
Abstract
The maximum flow problem is an optimization problem which takes place in the graph theory. This problem is noteworthy by the long succession of research contributions that have improved on the worst-case complexity of the best known algorithms. The goal of this master thesis is to do an analysis of how the augmenting path algorithms and the preflow-push algorithm, two families of maximum flow algorithm, perform in different families of graphs.