No public access
master's thesis
Maximum bipartite matching problem via maximum flow in flow networks

Zvonimir Spajić (2014)
University of Zagreb
Faculty of Electrical Engineering and Computing
Cite this document...

Spajić, Z. (2014). Problem maksimalnog sparivanja u bipartitnim grafovima uz pomoć maksimalnog protoka u transportnim mrežama (Master's thesis). Retrieved from https://urn.nsk.hr/urn:nbn:hr:168:118316

Spajić, Zvonimir. "Problem maksimalnog sparivanja u bipartitnim grafovima uz pomoć maksimalnog protoka u transportnim mrežama." Master's thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2014. https://urn.nsk.hr/urn:nbn:hr:168:118316

Spajić, Zvonimir. "Problem maksimalnog sparivanja u bipartitnim grafovima uz pomoć maksimalnog protoka u transportnim mrežama." Master's thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2014. https://urn.nsk.hr/urn:nbn:hr:168:118316

Spajić, Z. (2014). 'Problem maksimalnog sparivanja u bipartitnim grafovima uz pomoć maksimalnog protoka u transportnim mrežama', Master's thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, accessed 20 August 2019, https://urn.nsk.hr/urn:nbn:hr:168:118316

Spajić Z. Problem maksimalnog sparivanja u bipartitnim grafovima uz pomoć maksimalnog protoka u transportnim mrežama [Master's thesis]. Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing; 2014 [cited 2019 August 20] Available at: https://urn.nsk.hr/urn:nbn:hr:168:118316

Z. Spajić, "Problem maksimalnog sparivanja u bipartitnim grafovima uz pomoć maksimalnog protoka u transportnim mrežama", Master's thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, Zagreb, 2014. Available at: https://urn.nsk.hr/urn:nbn:hr:168:118316