prikaz prve stranice dokumenta Sparivanje usmjerenih acikličkih grafova
  Download
PDF 386.97 KB
undergraduate thesis
Sparivanje usmjerenih acikličkih grafova
2020. urn:nbn:hr:126:101395
Blažević, Mislav
Josip Juraj Strossmayer University of Osijek
Department of Mathematics
Chair of Applied Mathematics and Computer Science
Computer Science and Machine Learning Research Group

Cite this document

Blažević, M. (2020). Sparivanje usmjerenih acikličkih grafova (Undergraduate thesis). Osijek: Josip Juraj Strossmayer University of Osijek, Department of Mathematics. Retrieved from https://urn.nsk.hr/urn:nbn:hr:126:101395

Blažević, Mislav. "Sparivanje usmjerenih acikličkih grafova." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Department of Mathematics, 2020. https://urn.nsk.hr/urn:nbn:hr:126:101395

Blažević, Mislav. "Sparivanje usmjerenih acikličkih grafova." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Department of Mathematics, 2020. https://urn.nsk.hr/urn:nbn:hr:126:101395

Blažević, M. (2020). 'Sparivanje usmjerenih acikličkih grafova', Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Department of Mathematics, accessed 17 November 2024, https://urn.nsk.hr/urn:nbn:hr:126:101395

Blažević M. Sparivanje usmjerenih acikličkih grafova [Undergraduate thesis]. Osijek: Josip Juraj Strossmayer University of Osijek, Department of Mathematics; 2020 [cited 2024 November 17] Available at: https://urn.nsk.hr/urn:nbn:hr:126:101395

M. Blažević, "Sparivanje usmjerenih acikličkih grafova", Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Department of Mathematics, Osijek, 2020. Available at: https://urn.nsk.hr/urn:nbn:hr:126:101395

Please login to the repository to save this object to your list.
Metadata
TitleSparivanje usmjerenih acikličkih grafova
Title (english)Matching Directed Acyclic Graphs
AuthorMislav Blažević
MentorDomagoj Matijević (mentor)
GranterJosip Juraj Strossmayer University of Osijek
Department of Mathematics
(Chair of Applied Mathematics and Computer Science)
(Computer Science and Machine Learning Research Group)
Osijek
Defense date and country2020-09-23, Croatia
Scientific / art field,
discipline and subdiscipline		NATURAL SCIENCES
Mathematics
Mathematical Logic and Accounting
Abstract
U ovom radu se bavimo problemom pronalaska maksimalnog sparivanja usmjerenih acikličkih grafova. Analizirat ćemo problem i prezentirat neke algoritme za rješavanje tog problema.
Abstract (english)
In this paper we study the problem of finding maximum weight matching of directed acyclic graphs. We will analyze the problem and present some algorithms for solving the problem.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:126:101395
Study programmeTitle: University undergraduate study programme in mathematics
Study programme type: university
Study level: undergraduate
Academic / professional title: sveučilišni/a prvostupnik/prvostupnica (baccalaureus/baccalaurea) matematike (sveučilišni/a prvostupnik/prvostupnica (baccalaureus/baccalaurea) matematike)
Type of resourceText
File originBorn digital
Access conditionsOpen access
Terms of useLicence In copyright icon
Created on2020-10-30 10:56:42