The Optimized Algorithm of Finding the Shortest Path in a Multiple Graph

DOI10.18255/1818-1015-2023-1-6-15zbMath1521.05201OpenAlexW4367297681MaRDI QIDQ6081673

Aleksandr Valer'Evich Smirnov

Publication date: 5 October 2023

Published in: Modeling and Analysis of Information Systems (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/mais787

zbMATH Keywords

shortest pathpolynomial algorithmreachability setmultiple graphmultiple path

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

The algorithms for the Eulerian cycle and Eulerian trail problems for a multiple graph

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• Algorithms for the Assignment and Transportation Problems
• The Polynomial Algorithm of Finding the Shortest Path in a Divisible Multiple Graph

This page was built for publication: The Optimized Algorithm of Finding the Shortest Path in a Multiple Graph