diplomsko delo
Veronika Horvat (Author), Polona Oblak (Mentor)

Abstract

Iskanje najcenejše poti v grafih preko polkolobarjev

Keywords

tropska algebra;kvazi inverz;Bellmanov algoritem;usmerjen graf;računalništvo;računalništvo in informatika;univerzitetni študij;diplomske naloge;

Data

Language: Slovenian
Year of publishing:
Typology: 2.11 - Undergraduate Thesis
Organization: UL FRI - Faculty of Computer and Information Science
Publisher: [V. Horvat]
UDC: 004.4:512(043.2)
COBISS: 1536062403 Link will open in a new window
Views: 73
Downloads: 5
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: Semirings and the shortest path problem
Secondary abstract: The thesis presents the problem of finding the shortest path in a directed graph with the Bellman's algorithm. This algorithm a version of Bellman equation with the novelty that the we work with matrices and operations over tropical semiring. Given a weighted directed graph, its arc prices are written in a matrix A. The matrix has a quasi-inverse A^* over tropical semiring, which is used to compute the minimal solution of the system of equations expressed from the Bellman equation. The solution of the algorithm is a vector of prices that represents the prices of the shortest paths to all nodes in the graph.
Secondary keywords: tropical algebra;quasi inverse;Bellman's algorithm;directed graph;computer science;computer and information science;diploma;
File type: application/pdf
Type (COBISS): Bachelor thesis/paper
Study programme: 1000468
Thesis comment: Univ. v Ljubljani, Fak. za računalništvo in informatiko
Pages: 31 str.
ID: 8739379