Network Flow Algorithms

Gregor Ajdič (2018) Network Flow Algorithms. EngD thesis.

Preview

Abstract

Let us assume that it is our intention to transfer material from source to sink through the nodes of a graph. Each edge has a certain capacity. Our goal is to determine how much material can be transferred from the source to the sink without violating the capacity limit. Initially basic linear programming techniques were used to solve this problem, but later many other algorithms were discovered. Some of them use approaches and methods that are interesting from a theoretical point of view, while others are more suitable for practical use. The aims of the thesis are the presentation of these algorithms, their analysis and the display of basic examples. We want to figure out which algorithm is currently the fastest in solving this problem.

Item Type:

Thesis (EngD thesis)

Keywords:

flow, network flow, residual network, augmenting paths, cuts, blocking path, dynamic trees, push relabel method, abundance graph

Number of Pages:

Language of Content:

Slovenian

Mentor / Comentors:

Name and Surname	ID	Function
prof. dr. Borut Robič	28	Mentor

Link to COBISS:

http://www.cobiss.si/scripts/cobiss?command=search&base=51012&select=(ID=1537756355)

Institution:

University of Ljubljana

Department:

Faculty of Computer and Information Science

Item ID:

4091

Date Deposited:

08 Mar 2018 15:22

Last Modified:

03 Apr 2018 10:14

URI:

http://eprints.fri.uni-lj.si/id/eprint/4091

Actions (login required)

View Item