Observer of changes in the forest of the shortest paths on dynamic graphs of transport networks
The purpose of the work is the development of basic data structures, speed-efficient and memoryefficient algorithms for tracking changes in predefined decisions about sets of shortest paths on transport networks, notifications about which are received by autonomous coordinated transport agents with...
Saved in:
Main Authors: | N. V. Khajynova, M. P. Revotjuk, L. Y. Shilin |
---|---|
Format: | Article |
Language: | Russian |
Published: |
Educational institution «Belarusian State University of Informatics and Radioelectronics»
2020-09-01
|
Series: | Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki |
Subjects: | |
Online Access: | https://doklady.bsuir.by/jour/article/view/2721 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The True Shortest Path of Obstacle Grid Graph Is Solved by SGP Vertex Extraction and Filtering Algorithm
by: Yijie Zhang, et al.
Published: (2025-06-01) -
The Shortest Path Problem for a Multiple Graph
by: Alexander V. Smirnov
Published: (2017-12-01) -
The Optimized Algorithm of Finding the Shortest Path in a Multiple Graph
by: Alexander Valeryevich Smirnov
Published: (2023-04-01) -
Threaded block-parallel algorithm for finding the shortest paths on graph
by: O. N. Karasik, et al.
Published: (2019-06-01) -
The Polynomial Algorithm of Finding the Shortest Path in a Divisible Multiple Graph
by: Alexander Valeryevich Smirnov
Published: (2022-12-01)