Language: | Slovenian |
---|---|
Year of publishing: | 2020 |
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 |
Views: | 291 |
Downloads: | 18 |
Average score: | 0 (0 votes) |
Metadata: |
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 |