Work

Methods for finding shortest paths on graphs in organizational and economic systems and their implementation

Year: 2019

Type: conference-paper

Abstract: The article implements the functions in Postgre SQL DBMS, finding the shortest paths on graphs, using the wave algorithm method, the Dijkstra’s method and the Floyd method. The authors determined models of dependencies of the running time of implementations of the shortest-path search algorithms on graphs on the number of graph vertices experimentally. A comparison of the data obtained as a result of the study was carried out to find the best applications of implementations of the shortest path search algorithms in the Postgre SQL DBMS.

Source: International Conference on Information Technology and Nanotechnology (ITNT)

DOI: 10.18287/1613-0073-2019-2416-368-375

Authors: Vladimir Ramzaev, Irina Khaimovich, Ilya Martynov

Institutions: International Market Institute, Samara National Research University

Language: English

Topic: Graph Theory and Algorithms

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

OpenAlex ID: W2993536552

FWCI:

Cites: 11

Cited by: 1

Related to: 10