Povezanost grafov

diplomsko delo

Aljaž Nunčič (Author), Borut Robič (Mentor)

Abstract

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.

Keywords

graf;povezanost;povezavna povezanost;vozliščna povezanost;računalništvo in informatika;univerzitetni študij;diplomske naloge;

Data

Language:	Slovenian
Year of publishing:	2019
Typology:	2.11 - Undergraduate Thesis
Organization:	UL FRI - Faculty of Computer and Information Science
Publisher:	[A. Nunčič]
UDC:	004(043.2)
COBISS:	1538319299
Views:	679
Downloads:	228
Average score:	0 (0 votes)
Metadata:

Other data

Secondary language:	English
Secondary title:	Graph Connectivity
Secondary abstract:	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.
Secondary keywords:	graph;connectivity;edge connectivity;vertex connectivity;computer and information science;diploma;
Type (COBISS):	Bachelor thesis/paper
Study programme:	1000468
Embargo end date (OpenAIRE):	1970-01-01
Thesis comment:	Univ. v Ljubljani, Fak. za računalništvo in informatiko
Pages:	62 str.
ID:	11220281