This course talks about networks flows which are used in more obvious applications such as optimal matchings, finding disjoint paths and flight scheduling as well as more surprising ones like image ...

For example, to plot the execution time the Goldberg's highest label preflow algorithm on a scale-free graph with 30 nodes and comparing the result with the graph-tool's one, call: ...

Designing Solutions for the Algorithmic Future. Algorithms are an essential part of modern systems in science, industry, and society. We aim at designing and analyzing algorithms for problems from ...