prikaz prve stranice dokumenta Rješavanje problema najdužeg puta
  Download
PDF 353.09 KB
undergraduate thesis
Rješavanje problema najdužeg puta
Split: University of Split, University of Split, Faculty of science, 2016. urn:nbn:hr:166:379404
Dujić, Josip
University of Split
Faculty of Science
Department of Informatics

Cite this document

Dujić, J. (2016). Rješavanje problema najdužeg puta (Undergraduate thesis). Split: University of Split, Faculty of Science. Retrieved from https://urn.nsk.hr/urn:nbn:hr:166:379404

Dujić, Josip. "Rješavanje problema najdužeg puta." Undergraduate thesis, University of Split, Faculty of Science, 2016. https://urn.nsk.hr/urn:nbn:hr:166:379404

Dujić, Josip. "Rješavanje problema najdužeg puta." Undergraduate thesis, University of Split, Faculty of Science, 2016. https://urn.nsk.hr/urn:nbn:hr:166:379404

Dujić, J. (2016). 'Rješavanje problema najdužeg puta', Undergraduate thesis, University of Split, Faculty of Science, accessed 18 April 2024, https://urn.nsk.hr/urn:nbn:hr:166:379404

Dujić J. Rješavanje problema najdužeg puta [Undergraduate thesis]. Split: University of Split, Faculty of Science; 2016 [cited 2024 April 18] Available at: https://urn.nsk.hr/urn:nbn:hr:166:379404

J. Dujić, "Rješavanje problema najdužeg puta", Undergraduate thesis, University of Split, Faculty of Science, Split, 2016. Available at: https://urn.nsk.hr/urn:nbn:hr:166:379404

Please login to the repository to save this object to your list.
Metadata
TitleRješavanje problema najdužeg puta
Title (english)Solving Longest Route Problem
AuthorJosip Dujić
MentorBranko Žitko (mentor)
Committee memberBranko Žitko (predsjednik povjerenstva)
Committee memberAni Grubišić (član povjerenstva)
Committee memberDivna Krpan (član povjerenstva)
GranterUniversity of Split
Faculty of Science
(Department of Informatics)
Split
Defense date and country2016-09-14, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Abstract
Poopćenje problema najdužeg puta je pronalazak najdužeg Hamiltonovog puta u potpunom grafu. Dokazana je NP-kompletnost problema. Prikazani su slični problemi te postupci rješavanja problema korištenjem egaktnih algoritama i algoritama aproksimacije. Algoritmi pretraživanja su implementirani u Pythonu te su rezultati njihova izvršavanja analizirani i uspoređeni.
Abstract (english)
Generalization of the Longest path problem is problem of finding the longest Hamiltionian path in a complete graph. This problem is proven to be NP-complete. Similar problems are shown as well as the methods of computing the solution using exact algorithms and approximation algorithms. Search algorithms are implemented in Python and results of their execution are analyzed and compared.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:166:379404
Study programmeTitle: Computer Science
Study programme type: university
Study level: undergraduate
Academic / professional title: sveučilišni/a prvostupnik/prvostupnica (baccalaureus/baccalaurea) informatike (sveučilišni/a prvostupnik/prvostupnica (baccalaureus/baccalaurea) informatike)
Type of resourceText
File originBorn digital
Access conditionsOpen access
Terms of useLicence Attribution-NonCommercial 4.0 International (CC BY-NC 4.0) icon
RepositoryRepository of Faculty of Science
Created on2017-06-12 15:51:38