prikaz prve stranice dokumenta Sparivanja u bipartitnim grafovima
No public access
undergraduate thesis
Sparivanja u bipartitnim grafovima
Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing, 2023. urn:nbn:hr:168:761915
Vukasović, Rea
University of Zagreb
Faculty of Electrical Engineering and Computing

Institutional repository: FER Repository

Cite this document

Vukasović, R. (2023). Sparivanja u bipartitnim grafovima (Undergraduate thesis). Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing. Retrieved from https://urn.nsk.hr/urn:nbn:hr:168:761915

Vukasović, Rea. "Sparivanja u bipartitnim grafovima." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2023. https://urn.nsk.hr/urn:nbn:hr:168:761915

Vukasović, Rea. "Sparivanja u bipartitnim grafovima." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2023. https://urn.nsk.hr/urn:nbn:hr:168:761915

Vukasović, R. (2023). 'Sparivanja u bipartitnim grafovima', Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, accessed 28 June 2024, https://urn.nsk.hr/urn:nbn:hr:168:761915

Vukasović R. Sparivanja u bipartitnim grafovima [Undergraduate thesis]. Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing; 2023 [cited 2024 June 28] Available at: https://urn.nsk.hr/urn:nbn:hr:168:761915

R. Vukasović, "Sparivanja u bipartitnim grafovima", Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, Zagreb, 2023. Available at: https://urn.nsk.hr/urn:nbn:hr:168:761915

Metadata
TitleSparivanja u bipartitnim grafovima
Title (english)Matchings in Bipartite Graphs
AuthorRea Vukasović
MentorAndrea Aglić Aljinović (mentor)
Committee memberAndrea Aglić Aljinović (predsjednik povjerenstva)
Committee memberJosipa Pina Milišić (član povjerenstva)
Committee memberLana Horvat Dmitrović (član povjerenstva)
GranterUniversity of Zagreb
Faculty of Electrical Engineering and Computing
Zagreb
Defense date and country2023-07-06, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Abstract
Na početku rada je definiran pojam bipartitnog grafa. U nastavku su prikazani istaknutiji oblici bipartitnih grafova poput stabla i cikličkih grafova. U radu se zatim detaljnije analizira pojam sparivanja s naglaskom na pojmove savršenog i maksimalnog sparivanja. U kontekstu sparivanja bipartitnih grafova spominje se Kőnig- Egerváry teorem. Rad pokriva i pojam sustava izrazitih predstavnika i daje dokaz Hallovog teorema kao središnjeg teorema u kontekstu sparivanja bipartitnih grafova.
Abstract (english)
At the beginning of the paper, the concept of a bipartite graph is defined. The following sections present prominent forms of bipartite graphs such as trees and cycles. The paper then provides a more detailed analysis of the concept of matching, with emphasis on the notions of perfect and maximal matching. In the context of matching in bipartite graphs, the Kőnig-Egerváry theorem is mentioned. The paper also covers the concept of systems of distinct representatives and provides a proof of Hall's theorem as a central theorem in the context of matching in bipartite graphs.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:168:761915
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 10:59:47