prikaz prve stranice dokumenta Pohlepni algoritmi za bojanje vrhova grafova
No public access
undergraduate thesis
Pohlepni algoritmi za bojanje vrhova grafova
Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing, 2016. urn:nbn:hr:168:167262
Bukal, Marko
University of Zagreb
Faculty of Electrical Engineering and Computing

Institutional repository: FER Repository

Cite this document

Bukal, M. (2016). Pohlepni algoritmi za bojanje vrhova grafova (Undergraduate thesis). Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing. Retrieved from https://urn.nsk.hr/urn:nbn:hr:168:167262

Bukal, Marko. "Pohlepni algoritmi za bojanje vrhova grafova." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2016. https://urn.nsk.hr/urn:nbn:hr:168:167262

Bukal, Marko. "Pohlepni algoritmi za bojanje vrhova grafova." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2016. https://urn.nsk.hr/urn:nbn:hr:168:167262

Bukal, M. (2016). 'Pohlepni algoritmi za bojanje vrhova grafova', Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, accessed 26 June 2024, https://urn.nsk.hr/urn:nbn:hr:168:167262

Bukal M. Pohlepni algoritmi za bojanje vrhova grafova [Undergraduate thesis]. Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing; 2016 [cited 2024 June 26] Available at: https://urn.nsk.hr/urn:nbn:hr:168:167262

M. Bukal, "Pohlepni algoritmi za bojanje vrhova grafova", Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, Zagreb, 2016. Available at: https://urn.nsk.hr/urn:nbn:hr:168:167262

Metadata
TitlePohlepni algoritmi za bojanje vrhova grafova
Title (english)Greedy Algorithms for graph vertex coloring
AuthorMarko Bukal
MentorMario Osvin Pavčević (mentor)
Committee memberMario Osvin Pavčević (predsjednik povjerenstva)
Committee memberLana Horvat Dmitrović (član povjerenstva)
Committee memberAndrea Aglić Aljinović (član povjerenstva)
GranterUniversity of Zagreb
Faculty of Electrical Engineering and Computing
Zagreb
Defense date and country2016-09-05, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Abstract
U ovome završnom radu proučava se bojanje grafova postupkom pohlepnog bojanja i primjenom sekvencijskih strategija FF, LDO, IDO i SDO. Navedene strategije se uspoređuju s obzirom na vrijeme izvođenja, udaljenost od optimalnog rješenja te na kompleksnost implementacije. Algoritmi se testiraju na DIMACS bazi grafova.
Abstract (english)
In this final thesis we study the classical graph coloring problem and we try to solve it algorithmically using greedy coloring and adequate sequential strategies like FF, LDO, IDO and SDO. We compare different strategies from the aspect of implementation complexity, time complexity and solution approximation quality. In order to do that, we test our algorithms using DIMACS database of simple graphs created for graph coloring experimentation.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:168:167262
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 on2018-02-06 08:05:41