diplomsko delo
Jan Rober (Author), Simon Kolmanič (Mentor)

Abstract

Zaključno delo raziskuje Steinerjeva drevesa in njihovo vlogo pri reševanju problemov. Na začetku je podana definicija Steinerjevega drevesa in njihova uporaba. V nadaljevanju je predstavljen eden izmed algoritmov za iskanje Steinerjevih dreves v grafih in rezultati meritev delovanja algoritma nad različnimi grafi. V zadnjem delu je raziskan vpliv Steinerjevih vozlišč na graf.

Keywords

Steinerjeva drevesa;teorija grafov;minimalna vpeta drevesa;diplomske naloge;

Data

Language: Slovenian
Year of publishing:
Typology: 2.11 - Undergraduate Thesis
Organization: UM FERI - Faculty of Electrical Engineering and Computer Science
Publisher: [J. Rober]
UDC: 004.021:519.172.1(043.2)
COBISS: 39229699 Link will open in a new window
Views: 291
Downloads: 18
Average score: 0 (0 votes)
Metadata: JSON JSON-RDF JSON-LD TURTLE N-TRIPLES XML RDFA MICRODATA DC-XML DC-RDF RDF

Other data

Secondary language: English
Secondary title: Steiner tree problem
Secondary abstract: This final work researches Steiner trees and their role in solving problems. First part of this work presents the definitions of the Steiner trees and describes their use. Second part contains detailed description of one of the algorithms used to find Steiner trees in graphs together with the running time measurement for different graphs. Last part focuses on effect of Steiner points on any given graph.
Secondary keywords: Steiner tree;graph theory;minimum spanning tree;
Type (COBISS): Bachelor thesis/paper
Thesis comment: Univ. v Mariboru, Fak. za elektrotehniko, računalništvo in informatiko, Računalništvo in informacijske tehnologije
Pages: VIII, 42 f.
ID: 11980464