prikaz prve stranice dokumenta Dekompozicije potpunog grafa u trokutove
No public access
undergraduate thesis
Dekompozicije potpunog grafa u trokutove
Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing, 2023. urn:nbn:hr:168:380104
Majdiš, Martina
University of Zagreb
Faculty of Electrical Engineering and Computing

Institutional repository: FER Repository

Cite this document

Majdiš, M. (2023). Dekompozicije potpunog grafa u trokutove (Undergraduate thesis). Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing. Retrieved from https://urn.nsk.hr/urn:nbn:hr:168:380104

Majdiš, Martina. "Dekompozicije potpunog grafa u trokutove." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2023. https://urn.nsk.hr/urn:nbn:hr:168:380104

Majdiš, Martina. "Dekompozicije potpunog grafa u trokutove." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2023. https://urn.nsk.hr/urn:nbn:hr:168:380104

Majdiš, M. (2023). 'Dekompozicije potpunog grafa u trokutove', Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, accessed 18 November 2024, https://urn.nsk.hr/urn:nbn:hr:168:380104

Majdiš M. Dekompozicije potpunog grafa u trokutove [Undergraduate thesis]. Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing; 2023 [cited 2024 November 18] Available at: https://urn.nsk.hr/urn:nbn:hr:168:380104

M. Majdiš, "Dekompozicije potpunog grafa u trokutove", Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, Zagreb, 2023. Available at: https://urn.nsk.hr/urn:nbn:hr:168:380104

Metadata
TitleDekompozicije potpunog grafa u trokutove
Title (english)Complete graph decompositions in triangles
AuthorMartina Majdiš
MentorMario Osvin Pavčević (mentor)
Committee memberMario Osvin Pavčević (predsjednik povjerenstva)
Committee memberJosip Žubrinić (član povjerenstva)
Committee memberVlatko Crnković (član povjerenstva)
GranterUniversity of Zagreb
Faculty of Electrical Engineering and Computing
Zagreb
Defense date and country2023-08-31, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Abstract
Problemima dekompozicije grafova bave se mnogi matematičari već dugi niz godina. Dekompozicije grafova korisne su računarstvo, ali i brojna druga područja. Za dekompoziciju potpunih grafova u trokute točno se zna kako dobiti valjanu dekompoziciju, a u ovom radu ne bavimo se samo takvim konstrukcijama nego i algoritamskim pristupom tom problemu. Da bismo ga mogli jasnije objasniti i algoritme koji su korišteni za njegovo rješavanje, objašnjene su i dekompozicije općenito te Steinerov sustav trojki. Uspoređujemo vrijeme potrebno pojedinom algoritmu za rješavanje dekompozicije i vizualno prikazujemo rezultate.
Abstract (english)
Graph decomposition problems have been studied by many mathematicians over a long period of time. These decompositions are useful to us in computer science and various other fields. For the decomposition of complete graphs into triangles, we know how to obtain a valid decomposition. However, in this paper, we will not only consider such constructions but also take an algorithmic approach to the problem. In order to explain this problem and algorithms used to solve it in a more clear manner, decompositions in general along with Steiner triple systems will be further explained. This will be compared through the time required for each algorithm to solve the decomposition and finally we will visually present the results.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:168:380104
Study programmeTitle: Computing
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 conditionsClosed access
Terms of useLicence In copyright icon
Public note
Created on2023-10-11 09:37:44