Empirična primerjava algoritmov za iskanje najkrajših poti v omrežju : magistrsko delo

SLO

First page / Show document

Show document

A- | A+ | Print

Title:	Empirična primerjava algoritmov za iskanje najkrajših poti v omrežju : magistrsko delo
Authors:	ID Zugan, Dani (Author) ID Požar, Rok (Mentor) More about this mentor... ID Brodnik, Andrej (Comentor)
Files:	MAG_Zugan_Dani_2024.pdf (399,20 KB) MD5: EAC2DED8FD600AC9D5E88C27C5634A6C
Language:	Slovenian
Work type:	Master's thesis/paper
Typology:	2.09 - Master's Thesis
Organization:	FAMNIT - Faculty of Mathematics, Science and Information Technologies
Keywords:	iskanje najkrajših poti v omrežju, algoritem občutljiv na vhodne podatke, naključni grafi
Place of publishing:	Koper
Place of performance:	Koper
Publisher:	D. Zugan
Year of publishing:	2024
Year of performance:	2024
Number of pages:	1 spletni vir (1 datoteka PDF VIII, 28 str.))
PID:	20.500.12556/RUP-20572
UDC:	004.7(043.2)
COBISS.SI-ID:	207055619
Note:	Sistemske zahteve: Adobe Acrobat Reader
Publication date in RUP:	10.09.2024
Views:	352
Downloads:	11
Metadata:
:	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.

Language:	English
Title:	An empirical comparison of algorithms for finding shortest paths in a network : [master’s thesis]
Keywords:	finding shortest paths in the network, input-sensitive algorithm, random graphs

Leave comment

You must log in to leave a comment.

Comments (0)

0 - 0 / 0

There are no comments!

Back