prikaz prve stranice dokumenta Izabrani algoritmi teorije grafova
  Download
PDF 1.13 MB
master's thesis
Izabrani algoritmi teorije grafova
2024. urn:nbn:hr:166:851179
Krstić, Đana
University of Split
Faculty of Science

Cite this document

Krstić, Đ. (2024). Izabrani algoritmi teorije grafova (Master's thesis). Split: University of Split, Faculty of Science. Retrieved from https://urn.nsk.hr/urn:nbn:hr:166:851179

Krstić, Đana. "Izabrani algoritmi teorije grafova." Master's thesis, University of Split, Faculty of Science, 2024. https://urn.nsk.hr/urn:nbn:hr:166:851179

Krstić, Đana. "Izabrani algoritmi teorije grafova." Master's thesis, University of Split, Faculty of Science, 2024. https://urn.nsk.hr/urn:nbn:hr:166:851179

Krstić, Đ. (2024). 'Izabrani algoritmi teorije grafova', Master's thesis, University of Split, Faculty of Science, accessed 20 November 2024, https://urn.nsk.hr/urn:nbn:hr:166:851179

Krstić Đ. Izabrani algoritmi teorije grafova [Master's thesis]. Split: University of Split, Faculty of Science; 2024 [cited 2024 November 20] Available at: https://urn.nsk.hr/urn:nbn:hr:166:851179

Đ. Krstić, "Izabrani algoritmi teorije grafova", Master's thesis, University of Split, Faculty of Science, Split, 2024. Available at: https://urn.nsk.hr/urn:nbn:hr:166:851179

Please login to the repository to save this object to your list.
Metadata
TitleIzabrani algoritmi teorije grafova
Title (english)Selected Algorithms in Graph Theory
AuthorĐana Krstić
MentorDamir Vukičević (mentor)
Committee memberDamir Vukičević (predsjednik povjerenstva)
Committee memberAljoša Šubašić (član povjerenstva)
Committee memberTanja Vojković (član povjerenstva)
GranterUniversity of Split
Faculty of Science
Split
Defense date and country2024-09-26, Croatia
Scientific / art field,
discipline and subdiscipline		NATURAL SCIENCES
Mathematics
Abstract
Rad je centriran na odabranim algoritmima iz teorije grafova. Pojedini problemi, koji se općenito smatraju NP-teškima, postaju rješivi u polinomijalnom vremenu kad se primijene na specifične podklase savršenih grafova. Rad prikazuje algoritme za provjeru ispravnosti tipa tih grafova i složenost tih algoritama. Osim toga, rad uključuje i algoritam za sortiranje podatka u grafu, bavi se permutacijskim grafovima i njihovim bojanje, te provjeru planarnosti grafa.
Abstract (english)
The thesis is centered on selected algorithms in graph theory. Certain problems, which are usually considered NP-difficult, solvable in polynomial time when applied to specific subclasses of perfect graphs. The thesisThe paper presents algorithms for verifying the correctness of these graph types and their complexity. Additionally, the thesis includes an algorithm for sorting data stored in as a graph, it handles permutation graphs and their coloring, and verification of graph planarity.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:166:851179
Study programmeTitle: Mathematics; specializations in: specialization in Pure Mathematics, specialization in Computer Science, specialization in Education, specialization in Statistics and Computer Science
Course: specialization in Computer Science
Study programme type: university
Study level: graduate
Academic / professional title: sveučilišni/a magistar/magistra matematike (sveučilišni/a magistar/magistra matematike)
Type of resourceText
File originBorn digital
Access conditionsOpen access
Terms of useLicence In copyright icon
Created on2024-10-21 13:29:36