prikaz prve stranice dokumenta Brzi heuristički algoritam za problem vršnog pokrivača
  Download
PDF 830.01 KB
undergraduate thesis
Brzi heuristički algoritam za problem vršnog pokrivača
Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2020. urn:nbn:hr:200:377621
Tolj, Bruno
Josip Juraj Strossmayer University of Osijek
Faculty of Electrical Engineering, Computer Science and Information Technology Osijek
Department of Core Courses
Chair of Mathematics, Physics and Mechanical Engineering

Institutional repository: Faculty of Electrical Engineering, Computer Science and Information Technology Osijek

Cite this document

Tolj, B. (2020). Brzi heuristički algoritam za problem vršnog pokrivača (Undergraduate thesis). Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek. Retrieved from https://urn.nsk.hr/urn:nbn:hr:200:377621

Tolj, Bruno. "Brzi heuristički algoritam za problem vršnog pokrivača." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2020. https://urn.nsk.hr/urn:nbn:hr:200:377621

Tolj, Bruno. "Brzi heuristički algoritam za problem vršnog pokrivača." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2020. https://urn.nsk.hr/urn:nbn:hr:200:377621

Tolj, B. (2020). 'Brzi heuristički algoritam za problem vršnog pokrivača', Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, accessed 27 November 2024, https://urn.nsk.hr/urn:nbn:hr:200:377621

Tolj B. Brzi heuristički algoritam za problem vršnog pokrivača [Undergraduate thesis]. Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek; 2020 [cited 2024 November 27] Available at: https://urn.nsk.hr/urn:nbn:hr:200:377621

B. Tolj, "Brzi heuristički algoritam za problem vršnog pokrivača", Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, Osijek, 2020. Available at: https://urn.nsk.hr/urn:nbn:hr:200:377621

Metadata
TitleBrzi heuristički algoritam za problem vršnog pokrivača
Title (english)Fast heuristics for vertex cover problem
AuthorBruno Tolj
MentorTomislav Rudec (mentor)
MentorAlfonzo Baumgartner (sumentor)
Committee memberTomislav Rudec (predsjednik povjerenstva)
Committee memberZdravko Krpić (član povjerenstva)
Committee memberŽeljko Hocenski (član povjerenstva)
GranterJosip Juraj Strossmayer University of Osijek
Faculty of Electrical Engineering, Computer Science and Information Technology Osijek
(Department of Core Courses)
(Chair of Mathematics, Physics and Mechanical Engineering)
Osijek
Defense date and country2020-09-10, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Process Computing
Abstract
Cilj ovog završnog rada bio je napisati algoritam za rješavanje problema vršnog pokrivača iz teorije grafova. Algoritam je napisan u programskom jeziku C++. Rad je podjeljen na pet poglavlja. Nakon uvoda u drugom poglavlju problem je stavljen u kontekst s ostalim problemima vezanim uz teoriju grafova i NP-potpunu klasu problema. U trećem poglavlju opisani su i uspoređeni postojeći algoritmi prema brzini izvođenja i točnosti. Četvrto poglavlje bavi se posebnim slučajevima koji se mogu lakše rješiti i pravilima za grafove pomoću kojih se sužava mogući raspon rješenja. U petom poglavlju objašnjen je novi algoritam i uspoređen sa drugim algoritmima navedenima u ovome radu.
Abstract (english)
The goal of this paper was writing an algorithm for solving the vertex cover problem from graph theory. The algorithm is written in the C++ programming language. The paper is split into five chapters. After introduction in the second chapter the problem is put into context with other problems in graph theory and the NP-complete class. In the third chapter existing algorithms are described and compared based on execution speed and accuracy. The forth chapter deals with special cases which can be solved easier and graph rules which help narrow down the range of possible solutions. In the fifth chapter the new algorithm is explained and compared with other algorithms listed in this paper.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:200:377621
Study programmeTitle: Undergraduate University Study Programme in Computer Engineering
Study programme type: university
Study level: undergraduate
Academic / professional title: sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva (sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva)
Type of resourceText
File originBorn digital
Access conditionsOpen access
Terms of useLicence In copyright icon
Created on2020-11-12 14:16:27