20.500.12556/RUL-109867 Povezanost grafov Graph Connectivity Povezanost grafa nam pove, koliko povezav oziroma vozlišč moramo odstraniti, da graf postane nepovezan. Tako poznamo povezavno povezanost in vozliščno povezanost grafa. Na začetku bom predstavil nekaj izrekov, ki se nanašajo na povezanost grafov. Nato bom opisal algoritme za preverjanje povezanosti grafov, ki služijo tudi kot orodje za preverjanje uspešnega razbitja grafov. V zadnjem delu pa bom najprej predstavil reševanje problema minimalnega prereza z algoritmom za največji pretok, nato pa še druge naprednejše in bolj prilagojene algoritme za ta problem. V zaključku bom povzel vse ključne ugotovitve. Diplomska naloga tako predstavlja osnovni pregled problema povezanosti grafov. Graphs connectivity tells us how many edges or vertices must be removed from a graph so that the graph becomes disconnected. This induces the notations of the edge and vertex connectivity of a graph. In this thesis, I will first present some of the theorems related to graph connectivity. Then I will describe algorithms for checking whether or not a graph is connected, which can also be used to check whether or not a graph has been successfully split. Next, I will show how the min-cut problem is solved using the algorithm for maximum flow. Then, I will continue with presentation of some advanced and more adapted algorithms for the considered problem. Finally, I will conclude the thesis with a summary of the key findings. The thesis is thus a basic overview of the problem of graph connectivity. graf povezanost povezavna povezanost vozliščna povezanost graph connectivity edge connectivity vertex connectivity true false false Slovenski jezik Angleški jezik Diplomsko delo/naloga 2019-09-09 12:00:16 2019-09-09 12:00:18 2022-08-21 03:45:01 0000-00-00 00:00:00 2019 0 0 0000-00-00 NiDoloceno NiDoloceno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 1970-01-01 23600 1538319299 Nuncic_Aljaz_-_Povezanost_grafov.pdf Nuncic_Aljaz_-_Povezanost_grafov.pdf 1 B54F3005DBE6F88077EA62ABF4C2BE50 5452241a0ada1b20787f16ccc599ea512dfa1d4cfcf091107eba558a083e8dd4 fa6bc68d-a1b6-11eb-a523-00155dcfd717 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=121470 Fakulteta za računalništvo in informatiko 0 0 0