Your browser does not allow JavaScript!
JavaScript is necessary for the proper functioning of this website. Please enable JavaScript or use a modern browser.
|
|
SLO
|
ENG
|
Cookies and privacy
DKUM
EPF - Faculty of Business and Economics
FE - Faculty of Energy Technology
FERI - Faculty of Electrical Engineering and Computer Science
FF - Faculty of Arts
FGPA - Faculty of Civil Engineering, Transportation Engineering and Architecture
FKBV - Faculty of Agriculture and Life Sciences
FKKT - Faculty of Chemistry and Chemical Engineering
FL - Faculty of Logistic
FNM - Faculty of Natural Sciences and Mathematics
FOV - Faculty of Organizational Sciences in Kranj
FS - Faculty of Mechanical Engineering
FT - Faculty of Tourism
FVV - Faculty of Criminal Justice and Security
FZV - Faculty of Health Sciences
MF - Faculty of Medicine
PEF - Faculty of Education
PF - Faculty of Law
UKM - University of Maribor Library
UM - University of Maribor
UZUM - University of Maribor Press
COBISS
Faculty of Business and Economic, Maribor
Faculty of Agriculture and Life Sciences, Maribor
Faculty of Logistics, Celje, Krško
Faculty of Organizational Sciences, Kranj
Faculty of Criminal Justice and Security, Ljubljana
Faculty of Health Sciences
Library of Technical Faculties, Maribor
Faculty of Medicine, Maribor
Miklošič Library FPNM, Maribor
Faculty of Law, Maribor
University of Maribor Library
Bigger font
|
Smaller font
Introduction
Search
Browsing
Upload document
Statistics
Login
First page
>
Show document
Show document
Title:
Problem Steinerjevih dreves : diplomsko delo
Authors:
ID
Rober, Jan
(
Author
)
ID
Kolmanič, Simon
(
Mentor
)
More about this mentor...
Files:
VS_Rober_Jan_2020.pdf
(833,89 KB)
MD5: 5AD8788F7450C6AE2D2BAEB7FD0906F2
PID:
20.500.12556/dkum/91c099f6-c9cf-4ba7-afa8-abab9a50cc79
Language:
Slovenian
Work type:
Bachelor thesis/paper
Typology:
2.11 - Undergraduate Thesis
Organization:
FERI - Faculty of Electrical Engineering and Computer Science
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
Place of publishing:
Maribor
Place of performance:
Maribor
Publisher:
[J. Rober]
Year of publishing:
2020
Number of pages:
VIII, 42 f.
PID:
20.500.12556/DKUM-77357
UDC:
004.021:519.172.1(043.2)
COBISS.SI-ID:
39229699
NUK URN:
URN:SI:UM:DK:NYTZQ7V8
Publication date in DKUM:
03.11.2020
Views:
1409
Downloads:
68
Metadata:
Categories:
KTFMB - FERI
Cite this work
Plain text
BibTeX
EndNote XML
EndNote/Refer
RIS
ABNT
ACM Ref
AMA
APA
Chicago 17th Author-Date
Harvard
IEEE
ISO 690
MLA
Vancouver
:
Copy citation
Average score:
(0 votes)
Your score:
Voting is allowed only for
logged in
users.
Share:
Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.
Licences
License:
CC BY-NC-ND 4.0, Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
Link:
http://creativecommons.org/licenses/by-nc-nd/4.0/
Description:
The most restrictive Creative Commons license. This only allows people to download and share the work for no commercial gain and for no other purposes.
Licensing start date:
27.08.2020
Secondary language
Language:
English
Title:
Steiner tree problem
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.
Keywords:
Steiner tree
,
Graph theory
,
Minimum spanning tree
Comments
Leave comment
You must
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back
