Paralelne heuristike za problem max-cut

Buzov, Saša (2014) Paralelne heuristike za problem max-cut. Diploma thesis, Faculty of Science > Department of Mathematics.

[img]
Preview
PDF
Language: Croatian

Download (1MB) | Preview
[img] Archive (popratni materijali ("source code"))
Language: English

Download (1MB)

Abstract

In this thesis, we presented one possible solution to problem of finding maximum cut in graph. We started with describing the problem with basic definitions from graph theory and computational complexity. Later we provided both sequential and parallel algorithms for solving before mentioned problem. In last few chapter we described testing environment, test data set, and our test results. Obtained results show that parallel approach has better performance for large scale problems. After analysis, we came to conclusion that parallel is the way to go, if and only if you have large scale problem.

Item Type: Thesis (Diploma thesis)
Supervisor: Nogo, Goranka
Date: 2014
Number of Pages: 42
Subjects: NATURAL SCIENCES > Mathematics
Divisions: Faculty of Science > Department of Mathematics
Depositing User: Iva Prah
Date Deposited: 02 Jun 2015 08:41
Last Modified: 02 Jun 2015 08:41
URI: http://digre.pmf.unizg.hr/id/eprint/3910

Actions (login required)

View Item View Item