A Comparative Study of the Labelling Algorithms for Solving the Problem of Maximum Flow in Networks

• In this paper, the analysis of three labeling algorithms for finding the maximum flow in networks is presented. For each algorithm, a computer program is written and tested on networks. The comparison is made on the basis of the processing time and memory storage required for the implementation of each program. As a result, the relationship between the processing time required for each algorithm and the complexity of the networks is established.

Ämnesord

NATURVETENSKAP  -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)

NATURAL SCIENCES  -- Computer and Information Sciences -- Computer Sciences (hsv//eng)

Nyckelord

Algorithm

maximum flow problem

optimization

Computer science

Datavetenskap

Publikations- och innehållstyp

vet (ämneskategori)

kon (ämneskategori)